Date: 18 Jan 2002

Closed Freyd- and κ-categories

* Final gross prices may vary according to local VAT.

Get Access


We give two classes of sound and complete models for the computational λ-calculus, or λc-calculus. For the first, we generalise the notion of cartesian closed category to that of closed Freyd-category. For the second, we generalise simple indexed categories. The former gives a direct semantics for the computational λ-calculus. The latter corresponds to an idealisation of stack-based intermediate languages used in some approaches to compiling.

This work is supported by EPSRC grant GR/J84205: Frameworks for programming language semantics and logic.
Supported by EPSRC grant GR/L54639.