Skip to main content Accessibility help
×
Home
Hostname: page-component-55597f9d44-xbgml Total loading time: 0.432 Render date: 2022-08-10T08:05:45.753Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "useRatesEcommerce": false, "useNewApi": true } hasContentIssue true

Preface

Published online by Cambridge University Press:  05 August 2013

Henk Barendregt
Affiliation:
Radboud Universiteit Nijmegen
Wil Dekkers
Affiliation:
Radboud Universiteit Nijmegen
Richard Statman
Affiliation:
Carnegie Mellon University, Pittsburgh, Pennsylvania
Get access

Summary

This book is about lambda terms typed using simple, recursive and intersection types. In some sense it is a sequel to Barendregt (1984).That book is about untyped lambda calculus. Types give the untyped terms more structure: function applications are allowed only in some cases. In this way one can single out untyped terms having special properties. But there is more to it. The extra structure makes the theory of typed terms quite different from the untyped ones.

The emphasis of the book is on syntax. Models are introduced only insofar as they give useful information about terms and types or if the theory can be applied to them.

The writing of this book has been different from the one on untyped lambda calculus. First of all, since many researchers are working on typed lambda calculus, we were aiming at a moving target. Moreover there has been a wealth of material to work with. For these reasons the book was written by several authors. Several long-term open problems have been solved during the period the book was written, notably the undecidability of lambda definability in finite models, the undecidability of second-order typability, the decidability of the unique maximal theory extending βη-conversion and the fact that the collection of closed terms of not every simple type is finitely generated, and the decidability of matching at arbitrary types of order higher than 4. The book has not been written as an encyclopedic monograph: many topics are only partially treated; for example, reducibility among types is analyzed only for simple types built up from only one atom.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2013

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • Preface
  • Henk Barendregt, Radboud Universiteit Nijmegen, Wil Dekkers, Radboud Universiteit Nijmegen, Richard Statman
  • Book: Lambda Calculus with Types
  • Online publication: 05 August 2013
  • Chapter DOI: https://doi.org/10.1017/CBO9781139032636.001
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • Preface
  • Henk Barendregt, Radboud Universiteit Nijmegen, Wil Dekkers, Radboud Universiteit Nijmegen, Richard Statman
  • Book: Lambda Calculus with Types
  • Online publication: 05 August 2013
  • Chapter DOI: https://doi.org/10.1017/CBO9781139032636.001
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • Preface
  • Henk Barendregt, Radboud Universiteit Nijmegen, Wil Dekkers, Radboud Universiteit Nijmegen, Richard Statman
  • Book: Lambda Calculus with Types
  • Online publication: 05 August 2013
  • Chapter DOI: https://doi.org/10.1017/CBO9781139032636.001
Available formats
×