Computer Science Logic

Volume 5213 of the series Lecture Notes in Computer Science pp 278-292

A Characterisation of Lambda Definability with Sums Via ⊤ ⊤-Closure Operators

  • Shin-ya KatsumataAffiliated withResearch Institute for Mathematical Sciences, Kyoto University

* Final gross prices may vary according to local VAT.

Get Access


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.