Utvidet returrett til 31. januar 2025

The Lambda Calculus. Its Syntax and Semantics

Om The Lambda Calculus. Its Syntax and Semantics

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.

Vis mer
  • Språk:
  • Engelsk
  • ISBN:
  • 9781848900660
  • Bindende:
  • Paperback
  • Sider:
  • 656
  • Utgitt:
  • 30. april 2012
  • Dimensjoner:
  • 226x158x36 mm.
  • Vekt:
  • 984 g.
  • BLACK NOVEMBER
  Gratis frakt
Leveringstid: 2-4 uker
Forventet levering: 20. desember 2024

Beskrivelse av The Lambda Calculus. Its Syntax and Semantics

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.

Brukervurderinger av The Lambda Calculus. Its Syntax and Semantics



Finn lignende bøker
Boken The Lambda Calculus. Its Syntax and Semantics finnes i følgende kategorier:

Gjør som tusenvis av andre bokelskere

Abonner på vårt nyhetsbrev og få rabatter og inspirasjon til din neste leseopplevelse.