Description
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.
This handbook with exercises reveals the mathematical beauty of formalisms hitherto mostly used for software and hardware design and verification.
About the Author
Henk Barendregt holds the chair on the Foundations of Mathematics and Computer Science at Radboud University, Nijmegen, The Netherlands. Wil Dekkers is an Associate Professor in the Institute of Information and Computing Sciences at Radboud University, Nijmegen, The Netherlands. Richard Statman is a Professor of Mathematics at Carnegie Mellon University, Pittsburgh, USA.
Reviews
'The book has a place in undergraduate libraries because of its uniquely comprehensive, if theoretical, treatment of a timely, widely important subject. Recommended.' D. V. Feldman, Choice
'The authors have produced a well-written, organised and comprehensive account of three important type systems. These systems' properties have been rich sources of interest to logicians for many years; their problems are not all solved, and in future work this book will almost certainly become a standard reference about them. It will also allow the more mathematically inclined computer scientist to obtain a deeper understanding of the principles behind some of the higher order languages in current use.' Bulletin of the London Mathematical Society
Book Information
ISBN 9780521766142
Author Henk Barendregt
Format Hardback
Page Count 856
Imprint Cambridge University Press
Publisher Cambridge University Press
Weight(grams) 1550g
Dimensions(mm) 244mm * 170mm * 44mm
This handbook with exercises reveals the mathematical beauty of formalisms hitherto mostly used for software and hardware design and verification.
About the Author
Henk Barendregt holds the chair on the Foundations of Mathematics and Computer Science at Radboud University, Nijmegen, The Netherlands. Wil Dekkers is an Associate Professor in the Institute of Information and Computing Sciences at Radboud University, Nijmegen, The Netherlands. Richard Statman is a Professor of Mathematics at Carnegie Mellon University, Pittsburgh, USA.
Reviews
'The book has a place in undergraduate libraries because of its uniquely comprehensive, if theoretical, treatment of a timely, widely important subject. Recommended.' D. V. Feldman, Choice
'The authors have produced a well-written, organised and comprehensive account of three important type systems. These systems' properties have been rich sources of interest to logicians for many years; their problems are not all solved, and in future work this book will almost certainly become a standard reference about them. It will also allow the more mathematically inclined computer scientist to obtain a deeper understanding of the principles behind some of the higher order languages in current use.' Bulletin of the London Mathematical Society
Book Information
ISBN 9780521766142
Author Henk Barendregt
Format Hardback
Page Count 856
Imprint Cambridge University Press
Publisher Cambridge University Press
Weight(grams) 1550g
Dimensions(mm) 244mm * 170mm * 44mm
