Computational lambda-calculus and monads
Proceedings of the Fourth Annual Symposium on Logic in computer science
Notions of computation and monads
Information and Computation
Premonoidal categories as categories with algebraic structure
Theoretical Computer Science
Linearity in Process Languages
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Abstract Syntax and Variable Binding
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Premonoidal categories and notions of computation
Mathematical Structures in Computer Science
Generic models for computational effects
Theoretical Computer Science - Logic, language, information and computation
Hi-index | 0.00 |
We give a universal embedding of the semantics for the first order fragment of the computational λ-calculus into a semantics for the whole calculus. In category theoretic terms, which are the terms of the paper, this means we give a universal embedding of every small Freydcategory into a closed Freyd-category. The universal property characterises the embedding as the free completion of the Freyd-category as a [→, Set]-enriched category under conical colimits. This embedding extends the usual Yoneda embedding of a small category with finite products into its free cocompletion, i.e., the usual category theoretic embedding of a model of the first order fragment of the simply typed λ-calculus into a model for the whole calculus, and similarly for the linear λ-calculus. It agrees with an embedding previously given in an ad hoc way without a universal property, so it shows the definitiveness of that construction.