Abstract Computing Machines

A Lambda Calculus Perspective

By Werner Kluge

Abstract Computing Machines Cover Image

  • ISBN13: 978-3-5402-1146-4
  • 404 Pages
  • User Level: Science
  • Publication Date: March 30, 2006
  • Available eBook Formats: PDF
  • eBook Price: $109.00
Buy eBook Buy Print Book Add to Wishlist
Full Description
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 a full-fledged beta-reduction as an essential prerequisite 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 (von Neumann) machines that permit side-effecting operations on the runtime environment.
Table of Contents

Table of Contents

  1. Preliminary Table of Contents: Algorithms and Programs.
  2. An Algorithmic Language.
  3. The Lambda Calculus.
  4. the SE(M)CD
  5. Machine.
  6. Towards Full
  7. fledged Lambda Calculus Machines.
  8. Head
  9. order Graph Reduction.
  10. The B
  11. Machine.
  12. The G
  13. Machine.
  14. The p
  15. RED Machinery.
Errata

Please Login to submit errata.

No errata are currently published