Structure and interpretation of computer programs

From the Publisher: With an analytical and rigorous approach to problem solving and programming techniques,this book is oriented toward engineering. Structure and Interpretation of Computer Programs emphasizes the central role played by different approaches to dealing with time in computational models. Its unique approach makes it appropriate for an introduction to computer science courses,as well as programming languages and program design.

[1]  E. Neville.  Srinivasa Ramanujan , Nature.

[2]  E. Wright,et al.  An Introduction to the Theory of Numbers , 1939 .

[3]  A. Church.  The calculi of lambda-conversion , 1941 .

[4]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1951 .

[5]  John McCarthy,et al.  A BASIS FOR A MATHEMATICAL THEORY OF COMPUTATION 1) , 2018 .

[6]  John McCarthy,et al.  Recursive functions of symbolic expressions and their computation by machine, Part I , 1960, Commun. ACM.

[7]  Peter Zilahy Ingerman,et al.  Thunks: a way of compiling procedure statements with some comments on procedure declarations , 1961, CACM.

[8]  Ivan E. Sutherland,et al.  Sketchpad a Man-Machine Graphical Communication System , 1899, Outstanding Dissertations in the Computer Sciences.

[9]  E. Lohse,et al.  A Correspondence Between ALGOL 60 and Church's Lambda- Notation: Part I* , 1965 .

[10]  P. J. Landin,et al.  Correspondence between ALGOL 60 and Church's Lambda-notation , 1965, Commun. ACM.

[11]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[12]  Robert W. Floyd,et al.  Nondeterministic Algorithms , 1967, JACM.

[13]  Edsger W. Dijkstra,et al.  The structure of the “THE”-multiprogramming system , 1968, CACM.

[14]  Bertram Raphael,et al.  The use of theorem-proving techniques in question-answering systems , 1968, ACM National Conference.

[15]  Carl Hewitt,et al.  PLANNER: A Language for Proving Theorems in Robots , 1969, IJCAI.

[16]  C. Cordell Green,et al.  Application of Theorem Proving to Problem Solving , 1969, IJCAI.

[17]  Donald Ervin Knuth,et al.  The Art of Computer Programming, Volume II: Seminumerical Algorithms , 1970 .

[18]  Robert Fenichel,et al.  A LISP garbage-collector for virtual-memory computer systems , 1969, CACM.

[19]  Donald E. Knuth,et al.  fundamental algorithms , 1969 .

[20]  Terry Winograd,et al.  Procedures As A Representation For Data In A Computer Program For Understanding Natural Language , 1971 .

[21]  Carl Hewitt,et al.  A language for proving theorems in robots , 1971, IJCAI 1971.

[22]  Gerald Jay Sussman,et al.  The Conniver Reference Manual , 1972 .

[23]  Warren Teitelman,et al.  The interlisp reference manual , 1974 .

[24]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

[25]  Robert A. Kowalski,et al.  Predicate Logic as Programming Language , 1974, IFIP Congress.

[26]  G. Chaitin.  Randomness and Mathematical Proof , 1975 .

[27]  Gerald Jay Sussman,et al.  Heuristic techniques in computer-aided circuit analysis , 1975 .

[28]  Stephen N. Zilles,et al.  Specification techniques for data abstractions , 1975 .

[29]  Allan Borodin,et al.  The computational complexity of algebraic and numeric problems , 1975, Elsevier computer science library.

[30]  Daniel P. Friedman,et al.  CONS Should Not Evaluate its Arguments , 1976, ICALP.

[31]  Gary L. Miller.  Riemann's Hypothesis and Tests for Primality , 1976, J. Comput. Syst. Sci..

[32]  J. W. Backus,et al.  Can programming be liberated from the von Neumann style , 1977 .

[33]  J. J. Horning,et al.  Report on the programming language Euclid , 1977, SIGP.

[34]  Jon Doyle,et al.  AMORD explicit control of reasoning , 1977, Artificial Intelligence and Programming Languages.

[35]  Keith L. Clark,et al.  Negation as Failure , 1987, Logic and Data Bases.

[36]  John V. Guttag,et al.  Abstract data types and the development of data structures , 1977, CACM.

[37]  Jon Doyle,et al.  Explicit Control of Reasoning , 1977 .

[38]  Jon Doyle,et al.  AMORD explicit control of reasoning , 1977, SIGART Newsl..

[39]  Guy L. Steele.  Debunking the “expensive procedure call” myth or, procedure call implementations considered harmful or, LAMBDA: The Ultimate GOTO , 1977, ACM '77.

[40]  Alan Borning,et al.  ThingLab - An Object-Oriented System for Building Simulations Using Constraints , 1977, IJCAI.

[41]  Carl Hewitt,et al.  Viewing Control Structures as Patterns of Passing Messages , 1977, Artif. Intell..

[42]  Joe Stoy,et al.  Denotational Semantics , 1977 .

[43]  John McCarthy,et al.  History of LISP , 1978, SIGP.

[44]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[45]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[46]  John A. Allen,et al.  The anatomy of lisp , 1980 .

[47]  David A. McAllester.  A Three Valued Truth Maintenance System. , 1978 .

[48]  Jack Minker,et al.  Logic and Data Bases , 1978, Springer US.

[49]  E. Wagner,et al.  Data type specification: Parameterization and the power of specification techniques , 1978, STOC.

[50]  Henry G. Baker,et al.  List processing in real time on a serial computer , 1978, CACM.

[51]  Richard C. Waters,et al.  A Method for Analyzing Loop Programs , 1979, IEEE Transactions on Software Engineering.

[52]  Richard Zippel,et al.  Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.

[53]  Robin Milner,et al.  Edinburgh LCF , 1979, Lecture Notes in Computer Science.

[54]  D. Hofstadter,et al.  Godel, Escher, Bach: An Eternal Golden Braid , 1979 .

[55]  Jon Doyle,et al.  A Truth Maintenance System , 1979, Artif. Intell..

[56]  Peter Henderson,et al.  Functional programming - application and implementation , 1980, Prentice Hall International Series in Computer Science.

[57]  Richard W. Hamming,et al.  Coding and Information Theory , 1980 .

[58]  Philip Wadler,et al.  Experience with an applicative string processing language , 1980, POPL '80.

[59]  Mitchell Wand,et al.  Continuation-Based Program Transformation Strategies , 1980, JACM.

[60]  Gerald Jay Sussman,et al.  CONSTRAINTS - A Language for Expressing Almost-Hierarchical Descriptions , 1980, Artif. Intell..

[61]  M. Rabin.  Probabilistic algorithm for testing primality , 1980 .

[62]  David A. McAllester.  An Outlook on Truth Maintenance. , 1980 .

[63]  David A. Moon,et al.  The Lisp Machine manual , 1981, SGAR.

[64]  Robert A. Kowalski,et al.  Logic for problem solving , 1982, The computer science library : Artificial intelligence series.

[65]  William D. Clinger.  Nondeterministic call by need is neither lazy nor by name , 1982, LFP '82.

[66]  Peter Henderson.  Functional geometry , 1982, LFP '82.

[67]  Jonathan Rees,et al.  T: a dialect of Lisp or LAMBDA: The ultimate software tool , 1982, LFP '82.

[68]  James W. Thatcher,et al.  Data Type Specification: Parameterization and the Power of Specification Techniques , 1982, TOPL.

[69]  Guy L. Steele,et al.  An overview of COMMON LISP , 1982, LFP '82.

[70]  J. Darlington,et al.  Functional programming and its applications , 1982 .

[71]  Henry Lieberman,et al.  A real-time garbage collector based on the lifetimes of objects , 1983, CACM.

[72]  Andrew Hodges,et al.  Alan Turing: The Enigma , 1983 .

[73]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[74]  David Robson,et al.  Smalltalk-80: The Language and Its Implementation , 1983 .

[75]  Guy L. Steele,et al.  Common Lisp the Language , 1984 .

[76]  Sundaresan Jayaraman,et al.  The TK!Solver book : a guide to problem-solving in science, engineering, business, and education , 1984 .

[77]  E E Kohlbecker,et al.  Syntactic extensions in the programming language LISP , 1986 .

[78]  Michel Raynal,et al.  Algorithms for mutual exclusion , 1986 .

[79]  Andrew W. Appel,et al.  Garbage Collection can be Faster than Stack Allocation , 1987, Inf. Process. Lett..

[80]  Marc Feeley,et al.  Using Closures for Code Generation , 1987, Comput. Lang..

[81]  David A. McAllester,et al.  Non-Deterministic Lisp with Dependency-directed Backtracking , 1987, AAAI.