Lambda Calculus with Types
By: and and
Sign Up Now!
Already a Member? Log In
You must be logged into Bookshare to access this title.
Learn about membership options,
or view our freely available titles.
- Synopsis
- The lambda calculus forms a prototype universal programming language, which in its untyped version is related to Lisp, and has been 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), which are used to design and verify IT products and mathematical proofs. In this book, the author focuses on three classes of typing for lambda terms: simple types, recursive types and intersection types. Unexpected mathematical beauty is revealed in these three formalisms of terms and types. Numerous exercises are provided to deepen the reader's understanding and increase their confidence using types.
- Copyright:
- 1935
Book Details
- Book Quality:
- Publisher Quality
- ISBN-13:
- 9781107272248
- Publisher:
- Cambridge University Press
- Date of Addition:
- 10/30/13
- Copyrighted By:
- Cambridge University Press
- Adult content:
- No
- Language:
- English
- Has Image Descriptions:
- No
- Categories:
- Nonfiction, Mathematics and Statistics
- Submitted By:
- Bookshare Staff
- Usage Restrictions:
- This is a copyrighted book.