Research

Models for the computational λ-calculus


Reference:

Power, J., 2001. Models for the computational λ-calculus. Electronic Notes in Theoretical Computer Science, 40, pp. 288-301.

Related documents:

This repository does not currently have the full-text of this item.
You may be able to access a copy if URLs are provided below.

Official URL:

http://dx.doi.org/10.1016/S1571-0661(05)80056-8

Abstract

We consider several different sound and complete classes of models for the computational ·-calculus, explain the definitions, and outline why one might be interested in the various classes. We first consider the class of closed -categories, a natural and direct generalisation of the notion of cartesian closed category. We then consider closed ·-categories, which are based upon indexed categories and which are closely related to modern compiling technology. Finally, we consider the class of cartesian closed categories · together with a ·-enriched monad. The latter class has the most developed abstract theory, which one can adopt and by which one can dispense with coherence details in the spirit of Mac Lane involving strengths.

Details

Item Type Articles
CreatorsPower, J.
DOI10.1016/S1571-0661(05)80056-8
DepartmentsFaculty of Science > Computer Science
RefereedYes
StatusPublished
ID Code26494

Export

Actions (login required)

View Item