The Lambda Calculus. Its Syntax and Semantics von Barendregt Henk: New (2012)

Beschreibung

Print on Demand pp. 656 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.

Bestandsnummer des Verk�ufers 108855410

Verk�ufer kontaktieren

Diesen Artikel melden

Bibliografische Details

Titel: The Lambda Calculus. Its Syntax and Semantics
Verlag: College Publications
Ver�ffentlichungsdatum: 2012
Sprache: Englisch
ISBN-10: 184890066X
ISBN-13: 9781848900660
Bindung: Softcover
Zustand: New

�ber diesen Titel

Inhaltsangabe

The Lambda Calculus, treated in this book mainly in its untyped version, consists of a collection of expressions, called lambda terms, together with ways how to rewrite and identify these. In the parts conversion, reduction, theories, and models the view is respectively 'algebraic', computational, with more ('coinductive') identifications, and finally set-theoretic. The lambda terms are built up from variables, using application and abstraction. Applying a term F to M has as intention that F is a function, M its argument, and FM the result of the application. This is only the intention: to actually obtain the result one has to rewrite the expression FM according to the reduction rules. Abstraction provides a way to create functions according to the effect when applying them. The power of the theory comes from the fact that computations, both terminating and infinite, can be expressed by lambda terms at a 'comfortable' level of abstraction.

Rese�a del editor

The Lambda Calculus, treated in this book mainly in its untyped version, consists of a collection of expressions, called lambda terms, together with ways how to rewrite and identify these. In the parts conversion, reduction, theories, and models the view is respectively 'algebraic', computational, with more ('coinductive') identifications, and finally set-theoretic. The lambda terms are built up from variables, using application and abstraction. Applying a term F to M has as intention that F is a function, M its argument, and FM the result of the application. This is only the intention: to actually obtain the result one has to rewrite the expression FM according to the reduction rules. Abstraction provides a way to create functions according to the effect when applying them. The power of the theory comes from the fact that computations, both terminating and infinite, can be expressed by lambda terms at a 'comfortable' level of abstraction.

��ber diesen Titel� kann sich auf eine andere Ausgabe dieses Titels beziehen.