Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/7058
Title: | Lambda calculus with types | Authors: | Barendregt H. Dekkers W. Statman R. Alessi F. Bezem M. Cardone F. Coppo M. Dezani-Ciancaglini M. Dowek G. Gilezan, Silvia Honsell F. Moortgat M. Severi P. Urzyczyn P. |
Issue Date: | 1-Jan-2011 | Journal: | Lambda Calculus with Types | Abstract: | © Association for Symbolic Logic 2013. This handbook with exercises reveals in formalisms, hitherto mainly used for hardware and software design and verification, unexpected mathematical beauty. The lambda calculus forms a prototype universal programming language, which in its untyped version is related to Lisp, and was treated in the first author's classic The Lambda Calculus (1984). The formalism has since been extended with types and used in functional programming (Haskell, Clean) and proof assistants (Coq, Isabelle, HOL), used in designing and verifying IT products and mathematical proofs. in this book, the authors focus on three classes of typing for lambda terms: Simple types, recursive types and intersection types. it is in these three formalisms of terms and types that the unexpected mathematical beauty is revealed. The treatment is authoritative and comprehensive, complemented by an exhaustive bibliography, and numerous exercises are provided to deepen the readers' understanding and increase their confidence using types. | URI: | https://open.uns.ac.rs/handle/123456789/7058 | ISBN: | 9781139032636 | DOI: | 10.1017/CBO9781139032636 |
Appears in Collections: | FTN Publikacije/Publications |
Show full item record
SCOPUSTM
Citations
67
checked on Aug 26, 2023
Page view(s)
41
Last Week
0
0
Last month
0
0
checked on Mar 15, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.