Abstract Computing Machines, Softcover reprint of hardcover 1st ed. 2005
A Lambda Calculus Perspective
Coll. Texts in Theoretical Computer Science. An EATCS

Author:

Language: French

84,35 €

Disponible chez l'éditeur (délai d'approvisionnement : 15 jours).

Add to cartAdd to cart
Abstract Computing Machines
Publication date:
384 p. · 15.5x23.5 cm · Broché

94,94 €

Sous réserve de disponibilité chez l'éditeur.

Add to cartAdd to cart
Abstract computing machines : A Lambda calculus perspective, Texts in theoretic al computer science. An EATCS series
Publication date:
384 p. · 15.5x23.5 cm · Relié

The book emphasizes the design of full-fledged, fully normalizing lambda calculus machinery, as opposed to the just weakly normalizing machines.

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.

Received a Dr. rer. nat. degree in physics from the Technical University Munich/Germany in 1968; worked in industrie/research institutes at the central laboratories of Siemens AG between 1963 and 1968, at Bell Northern Research Ltd in Ottawa/Canada between 1969, and 1972 at the Gesellschaft fuer Mathematik und Datenverarbeitung in St. Augustin/Germany between 1973 and 1978; became an associate professor of computer science at the University of Bonn/Germany in 1978; became a full professor of computer science at the University of Kiel/Germany retired in 2003.

Emphasizes the design of full-fledged, fully normalizing Lambda-calculus machinery, as opposed to the just weakly normalizing machines Includes supplementary material: sn.pub/extras