Skip to main content Accessibility help
×
Hostname: page-component-848d4c4894-75dct Total loading time: 0 Render date: 2024-05-23T13:55:49.781Z Has data issue: false hasContentIssue false

Simply typed and untyped lambda calculus revisited

Published online by Cambridge University Press:  24 September 2009

M. P. Fourman
Affiliation:
University of Edinburgh
P. T. Johnstone
Affiliation:
University of Cambridge
A. M. Pitts
Affiliation:
University of Cambridge
Get access

Summary

Abstract

In [6] one finds a general method to describe various (typed) λ-calculi categorically. Here we give an elementary formulation in terms of indexed categories of the outcome of applying this method to the simply typed λ-calculus. It yields a categorical structure in which one can describe exponent types without assuming cartesian product types. Specializing to the “monoid” case where one has only one type yields a categorical description of the untyped λ-calculus.

In the literature there are two categorical notions for the untyped λ-calculus: one by Obtulowicz and one by Scott & Koymans. The notion we arrive at subsumes both of these; it can be seen as a mild generalization of the first one.

Introduction

The straightforward way to describe the simply typed λ-calculus (denoted here by λ1) categorically is in terms of cartesian closed categories (CCC's), see [10]. On the type theoretic side this caused some discomfort, because one commonly uses only exponent types without assuming cartesian product types — let alone unit (i.e. terminal) types. The typical reply from category theory is that one needs cartesian products in order to define exponents. Below we give a categorical description of exponent types without assuming cartesian product types. We do use cartesian products of contexts; these always exist by concatenation. Thus both sides can be satisfied by carefully distinguishing between cartesian products of types and cartesian products of contexts. We introduce an appropriate categorical structure for doing so.

In [6] one can find a general method to describe typed λ-calculi categorically. One of the main organizing principles used there is formulated below. It deserves the status of a slogan.

Type
Chapter
Information
Applications of Categories in Computer Science
Proceedings of the London Mathematical Society Symposium, Durham 1991
, pp. 119 - 142
Publisher: Cambridge University Press
Print publication year: 1992

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.

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.

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.

Available formats
×