Lambda Calculus. Its Syntax and Semantics

Autor: Henk Barendregt

Limbă:

Legare: Carte broșată

Editura: College Publications

Disponibilitate: În depozitul extern

Expediem în 10-18 zile

152.28 lei

The Lambda Calculus, treated in this book mainly in its untyped version, consists of a collection of...

Informații despre carte

Autor

Henk Barendregt

Limbă

engleză

Legare

Carte - Carte broșată

Publicat

2012

Pagini

656

EAN

9781848900660

ISBN

184890066X

Enbook ID

05190325

Editura

College Publications

Greutate

956

Dimensiuni

226 x 158 x 36

Descriere completă

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.

S-ar putea să te intereseze

Clienții care au cumpărat această carte au mai cumpărat și

Cele mai căutate

Categories

Authors

Publishers

Produse

Produse

Cele mai căutate

Categories

Authors

Publishers

Produse

Produse

Lambda Calculus. Its Syntax and Semantics

Informații despre carte

Descriere completă

S-ar putea să te intereseze

Clienții care au cumpărat această carte au mai cumpărat și