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

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.

Essentials of programming languages

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.

Concrete Abstractions: An Introduction to Computer Science Using Scheme

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.

Problem posing interpretation of programming languages

  • C. LandauerK. 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, leaving

Representations of recursion

This paper examines the relations and translations between recursive definitions expressed in conventional mathematical notation, in SHARP APL, and in APL2; most are drawn from published SOUKXS.

Experience with an analytic approach to teaching programming languages

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.

Modeling Languages : A new Paradigm of Programming ∗

A new type of programming language which allows a modeler to combine declarative and algorithmic knowledge, that is, mathematical-logical constraints on the one hand and an instruction sequence defining an algorithm on the other hand is presented.

Introducing Computer Science Undergraduates to Principles of Programming Through a Functional Language

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.

Recursion, Iteration and Functional Languages

The functional language approach presented in this paper has advantages over imperative languages in the area of analysis of recursive and iterative algorithms.
...

References

SHOWING 1-10 OF 116 REFERENCES

Abstract data types and the development of data structures

This paper presents and discusses the application of an algebraic technique for the specification of abstract data types and presents examples of a top-down development of a symbol table for a block structured language.

Logic for problem solving

  • R. Kowalski
  • Psychology
    The computer science library : Artificial intelligence series
  • 1979
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 difficult

Nondeterministic Algorithms

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.

The anatomy of lisp

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.

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 implemented

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.

Experience with an applicative string processing language

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.

Explicit Control of Reasoning

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.

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 numerous
...