9781848900660 - the lambda calculus. its syntax and semantics (studies in logic) von barendregt, henk (3 Ergebnisse)
- Softcover
Anbieter: Anybook.com, Lincoln, Vereinigtes KönigreichAnybook.com
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Schlecht
EUR 23,22
EUR 15,96 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 1 verfügbar
Zustand: Poor. Volume 40. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. Book contains pen markings. In poor condition, suitable as a reading copy. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,1050grams, ISBN…:9781848900660.
- Softcover
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes KönigreichRia Christie Collections
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 29,00
EUR 14,06 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New. In.
- Softcover
Anbieter: Buchpark, Trebbin, DeutschlandBuchpark
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Gut
EUR 24,96
EUR 105,00 VersandVersand von Deutschland nach USAAnzahl: 2 verfügbar
Zustand: Gut. Zustand: Gut | Seiten: 656 | Sprache: Englisch | Produktart: Bücher | 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 tothe 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.
