Abstract computing machines : a lambda calculus perspective
Author(s)
Bibliographic Information
Abstract computing machines : a lambda calculus perspective
（Texts in theoretical computer science, An EATCS series）
Springer, c2005
Available at / 8 libraries
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references and index
Description and Table of Contents
Description
The book emphasizes the design of full-fledged, fully normalizing lambda calculus machinery, as opposed to the just weakly normalizing machines.
Table of Contents
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.
by "Nielsen BookData"