Structure and Interpretation of Computer Programs

@inproceedings{Abelson1985StructureAI,
  title={Structure and Interpretation of Computer Programs},
  author={Harold Abelson and Gerald J. Sussman},
  year={1985}
}
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. 
Application of computer science ideas to the presentation of mathematical theorems and proofs
TLDR
This paper illustrates how it is possible to apply methodologies from computer science, used in the development and presentation of computer programs, for the presentation of mathematical theorems and proofs through stepwise refinement, abstraction, and program verification. Expand
A Programming Language
TLDR
It is the central thesis of this book that the descriptive and analytic power of an adequate programming language amply repays the considerable effort required for its mastery. Expand
Concrete Abstractions: An Introduction to Computer Science Using Scheme
TLDR
This text covers the basics of programming and data structures, and gives first-time computer science students the opportunity to not only write programs, but to prove theorems and analyze algorithms as well. Expand
Essentials of programming languages
TLDR
This text focuses on the principles of the design and implementation of programming languages and the language SCHEME, a dialect of LISP, is used to demonstrate abstraction and representation. Expand
Problem posing interpretation of programming languages
  • C. Landauer, K. Bellman
  • Computer Science
  • Proceedings of the 32nd Annual Hawaii International Conference on Systems Sciences. 1999. HICSS-32. Abstracts and CD-ROM of Full Papers
  • 1999
In this paper, we describe a programming paradigm that changes the focus of programming from solution methods for certain application problems to the specification of the problems themselves, leavingExpand
Experience with an analytic approach to teaching programming languages
TLDR
An example of this approach to programming language pedagogy is presented along with suggested variations and discussion of a number of practical considerations that may be crucial to success in the classroom. Expand
Modeling Languages : A new Paradigm of Programming ∗
This paper presents a new type of programming language (also called modeling language) which allows a modeler to combine declarative and algorithmic knowledge, that is, mathematical-logicalExpand
Introducing Computer Science Undergraduates to Principles of Programming Through a Functional Language
TLDR
Experience at the Department of Computer Science of the University of Cyprus is discussed in introducing undergraduate students in Computer Science to principles of programming through a functional language, and more specifically the language Miranda. Expand
Recursion, Iteration and Functional Languages
TLDR
The functional language approach presented in this paper has advantages over imperative languages in the area of analysis of recursive and iterative algorithms. Expand
Fun, rigour and pragmatism in functional programming
A course on functional programming using Hope is presented. It describes the basic principles of functional programming, the syntax and semantics of Hope, and some techniques for the analysis andExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 133 REFERENCES
Logic for problem solving
This book investigates the application of logic to problem-solving and computer programming. It assumes no previous knowledge of these fields, and may be Karl duncker in addition to make difficultExpand
Nondeterministic Algorithms
TLDR
Algorithms to solve combinatorial search problems by using multiple-valued functions are illustrated with algorithms to find all solutions to the eight queens problem on the chessboard, and to finding all simple cycles in a network. Expand
Abstract data types and the development of data structures
TLDR
The application of an algebraic technique for the specification of abstract data types is presented and a top-down development of a symbol table for a block structured language is presented, including a discussion of the proof of its correctness. Expand
Application of Theorem Proving to Problem Solving
TLDR
This paper shows how an extension of the resolution proof procedure can be used to construct problem solutions and provides a discussion of solutions to sample problems including the "Monkey and Bananas" puzzle and the 'Tower of Hanoi" puzzle. Expand
The anatomy of lisp
TLDR
This book uses LISP as a means for relating topics which normally get treated in several separate courses, and uses data structures as the main thread in discussions because a proper appreciation of data structure as abstract objects is a necessary prerequisite to an understanding of modern computer science. Expand
History of LISP
This paper concentrates on the development of the basic ideas and distinguishes two periods - Summer 1958 through Summer 1958 when most of the key ideas were developed (some of which were implementedExpand
The Conniver Reference Manual
Abstract : The manual is an introduction and reference to the latest version of the Conniver programming language, an artificial intelligence language with general control and data-base structures.Expand
Experience with an applicative string processing language
TLDR
The major conclusions are: Applicative programming can be made more natural through the use of built-in iterative operators and post-fix notation and Clever evaluation strategies can make applicative programming more computationally efficient. Expand
Explicit Control of Reasoning
TLDR
An approach to dealing with the construction of expert problem-solving systems based on making some knowledge which is usually implicitly part of an expert problem solver explicit, thus allowing this knowledge about control to be manipulated and reasoned about is described. Expand
The computational complexity of algebraic and numeric problems
Thank you for downloading the computational complexity of algebraic and numeric problems elsevier computer science library theory of computation series 1. As you may know, people have search numerousExpand
...
1
2
3
4
5
...