Automata, Languages and Programming

Volume 1644 of the series Lecture Notes in Computer Science pp 625-634


Closed Freyd- and κ-categories

  • John PowerAffiliated withUniversity of Edinburgh
  • , Hayo ThieleckeAffiliated withQMW, University of London

* 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.