Authors: Ghilezan, Silvia 
Title: Proof Theory: Applications
Journal: Lambda Calculus with Types
First page: 323
Last page: 376
Issue Date: 1-Jan-2013
Rank: M14
ISBN: 978-1-139-03263-6
DOI: 10.1017/CBO9781139032636.010
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.
Publisher: Cambridge University Press

Show full item record


checked on May 31, 2023

Page view(s)

checked on May 31, 2023

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.