- We will send in 10–14 business days.
/images/books/13198429/9783642059384.jpg)
- Author: Werner Kluge
- Publisher: Springer
- Year: 2010
- Pages: 384
- ISBN-10: 3642059384
- ISBN-13: 9783642059384
- Format: 15.6 x 23.4 x 2.1 cm, minkšti viršeliai
- Language: English
- SAVE -10% with code: EXTRA
Reviews
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. This book takes a lambda calculus approach to organizing computations. It sets out with a brief introduction to lambda calculus, describes a variant of the classical SECD-machine as a basic interpreter for the lambda calculus, and in the main part continues with fully normalizing abstract lambda calculus machines, of which some are interpreting and some execute compiled code.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 22d.18:56:54
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Werner Kluge
- Publisher: Springer
- Year: 2010
- Pages: 384
- ISBN-10: 3642059384
- ISBN-13: 9783642059384
- Format: 15.6 x 23.4 x 2.1 cm, minkšti viršeliai
- Language: English English
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. This book takes a lambda calculus approach to organizing computations. It sets out with a brief introduction to lambda calculus, describes a variant of the classical SECD-machine as a basic interpreter for the lambda calculus, and in the main part continues with fully normalizing abstract lambda calculus machines, of which some are interpreting and some execute compiled code.
Reviews