A Characterisation of Lambda Definability with Sums Via ⊤ ⊤-Closure Operators
- Cite this paper as:
- Katsumata S. (2008) A Characterisation of Lambda Definability with Sums Via ⊤ ⊤-Closure Operators. In: Kaminski M., Martini S. (eds) Computer Science Logic. CSL 2008. Lecture Notes in Computer Science, vol 5213. Springer, Berlin, Heidelberg
We give a new characterisation of morphisms that are definable by the interpretation of the simply typed lambda calculus with sums in any bi-Cartesian closed category. The ⊤ ⊤-closure operator will be used to construct the category in which the collection of definable morphisms at sum types can be characterised as the coproducts of such collections at lower types.
Unable to display preview. Download preview PDF.