Lambda-calculus and combinators, an introduction

"In this up-to-date account of the subject, 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...

Descripción completa

Detalles Bibliográficos
Autor principal: Hindley, J. Roger (-)
Otros Autores: Seldin, J. P.
Formato: Libro electrónico
Idioma:Inglés
Publicado: Cambridge, UK ; New York : Cambridge University Press 2008.
Colección:EBSCO Academic eBook Collection Complete.
Acceso en línea:Conectar con la versión electrónica
Ver en Universidad de Navarra:https://innopac.unav.es/record=b38394959*spi
Descripción
Sumario:"In this up-to-date account of the subject, 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."--Jacket.
Descripción Física:xi, 345 p. : il
Formato:Forma de acceso: World Wide Web.
Bibliografía:Incluye referencias bibliográficas (p. 323-333) e índice.
ISBN:9780511415562
9780521898850
9780511413292
9780511809835
9781281751522