Abstract Computing Machines [electronic resource] :A Lambda Calculus Perspective / by W. Kluge ; edited by W. Brauer, G. Rozenberg, A. Salomaa.
by Kluge, W [author.]; Brauer, W [editor.]; Rozenberg, G [editor.]; Salomaa, A [editor.]; SpringerLink (Online service).
Material type:
BookSeries: Texts in Theoretical Computer Science, An EATCS Series: Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2005.Description: XIV, 384 p. 89 illus. online resource.ISBN: 9783540273592.Subject(s): Computer science | Logic design | Computer Science | Programming Languages, Compilers, Interpreters | Logics and Meanings of ProgramsDDC classification: 005.13 Online resources: Click here to access online | Item type | Current location | Call number | Status | Date due | Barcode |
|---|---|---|---|---|---|
| QA76.76.C65 (Browse shelf) | Available | ||||
| Long Loan | MAIN LIBRARY | QA76.7-76.73 (Browse shelf) | Available |
Browsing MAIN LIBRARY Shelves Close shelf browser
| B108-5802 The Discovery of Historicity in German Idealism and Historism | QA150-272 Solving Polynomial Equations | QA150-272 Multiplicative Invariant Theory | QA76.7-76.73 Abstract Computing Machines | LB1028.43-1028.75 Learning Design | QC790.95-791.8 Nuclear Fusion Research | R-RZ Reviews of Physiology, Biochemistry and Pharmacology |
Algorithms and Programs -- An Algorithmic Language -- The ?-Calculus -- The se(m)cd Machine and Others -- Toward Full-Fledged ?-Calculus Machines -- Interpreted Head-Order Graph Reduction -- The B-Machine -- The G-Machine -- The ?-red Machinery -- Pattern Matching -- Another Functional Abstract Machine -- Imperative Abstract Machines -- Real Computing Machines.
The book addresses ways and means of organizing computations, highlighting the relationship between algorithms and the basic mechanisms and runtime structures necessary to execute them using machines. It completely abstracts from concrete programming languages and machine architectures, taking instead the lambda calculus as the basic programming and program execution model to design various abstract machines for its correct implementation. The emphasis is on fully normalizing machines based on full-fledged beta-reductions as essential prerequisites for symbolic computations that treat functions and variables truly as first-class objects. Their weakly normalizing counterparts are shown to be functional abstract machines that sacrifice the flavors of full beta-reductions for decidedly simpler runtime structures and improved runtime efficiency. Further downgrading of the lambda calculus leads to classical imperative machines that permit side-effecting operations on the runtime environment.
There are no comments for this item.