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

Abstract Computing Machines: A Lambda Calculus Perspective
384
Abstract Computing Machines: A Lambda Calculus Perspective
384Product Details
ISBN-13: | 9783540211464 |
---|---|
Publisher: | Springer Berlin Heidelberg |
Publication date: | 04/06/2005 |
Series: | Texts in Theoretical Computer Science. An EATCS Series |
Edition description: | 2005 |
Pages: | 384 |
Product dimensions: | 6.10(w) x 9.25(h) x 0.24(d) |