Abstract Computing Machines: A Lambda Calculus Perspective 2005 Edition Contributor(s): Kluge, Werner (Author) |
|||
ISBN: 3540211462 ISBN-13: 9783540211464 Publisher: Springer
Binding Type: Hardcover - See All Available Formats & Editions Published: February 2005 Annotation: 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. Click for more in this series: Texts in Theoretical Computer Science. an Eatcs |
Additional Information |
BISAC Categories: - Mathematics | Logic - Mathematics | Calculus - Computers | Computer Science |
Dewey: 004 |
LCCN: 2004117887 |
Series: Texts in Theoretical Computer Science. an Eatcs |
Physical Information: 1.1" H x 6.52" W x 9.48" L (1.57 lbs) 384 pages |
Descriptions, Reviews, Etc. |
Publisher Description: The book emphasizes the design of full-fledged, fully normalizing lambda calculus machinery, as opposed to the just weakly normalizing machines. |
Customer ReviewsSubmit your own review |
To tell a friend about this book, you must Sign In First! |