Lambda-calculus and combinators : an introduction / Jonathan Paul, Seldin / James Roger, Hindley [ Livre]

Auteur principal: Hindley, James Roger, 1939-....Co-auteur: Seldin, Jonathan PaulLangue: Anglais ; de l'oeuvre originale, Anglais.Publication : Cambridge : Cambridge University Press, 2008Description : 1 vol. (XI-345 p.) ; 24 cmISBN: 9780521898850.Classification: F 4 1 Logique mathématiqueRésumé: Combinatory logic and lambda-calculus, originally devised in the 1920's, have since developed into linguistic tools, especially useful in programming languages. The authors' previous book served as the main reference for introductory courses on lambda-calculus for over 20 years: this long-awaited new version is thoroughly revised and offers a fully up-to-date account of the subject, with the same authoritative exposition. The grammar and basic properties of both combinatory logic and lambda-calculus are discussed, followed by an introduction to type-theory. Typed and untyped versions of the systems, and their differences, are covered. Lambda-calculus models, which lie behind much of the semantics of programming languages, are also explained in depth. The treatment is as non-technical as possible, with the main ideas emphasized and illustrated by examples. Many exercises are included, from routine to advanced, with solutions to most at the end of the book..Sujet - Nom commun: Lambda-calcul | Logique combinatoire
Current location Call number Status Notes Date due Barcode
ENS Rennes - Bibliothèque
Informatique
F 4 1 HIN (Browse shelf) Available F 4 1 Logique mathématique 039467

Combinatory logic and lambda-calculus, originally devised in the 1920's, have since developed into linguistic tools, especially useful in programming languages. The authors' previous book served as the main reference for introductory courses on lambda-calculus for over 20 years: this long-awaited new version is thoroughly revised and offers a fully up-to-date account of the subject, with the same authoritative exposition. The grammar and basic properties of both combinatory logic and lambda-calculus are discussed, followed by an introduction to type-theory. Typed and untyped versions of the systems, and their differences, are covered. Lambda-calculus models, which lie behind much of the semantics of programming languages, are also explained in depth. The treatment is as non-technical as possible, with the main ideas emphasized and illustrated by examples. Many exercises are included, from routine to advanced, with solutions to most at the end of the book.

Powered by Koha