Containers are a semantic way to talk about strictly positive types. In previous work it was shown that containers are closed under various constructions including products, coproducts, initial algebras and terminal coalgebras. In the present paper we show that, surprisingly, the category of containers is cartesian closed, giving rise to a full cartesian closed subcategory of endofunctors. The ...

In this paper, it is shown that the category of stratified $L$-generalized convergence spaces is monoidal closed if the underlying truth-value table $L$ is a complete residuated lattice. In particular, if the underlying truth-value table $L$ is a complete Heyting Algebra, the Cartesian closedness of the category is recaptured by our result.

Jacobs, B., Comprehension categories and the semantics of type dependency, Theoretical Computer Science 107 (1993) 169-207. A comprehension category is defined as a functor 8: E-+B’ satisfying (a) cod 0 9 is a fibration, and (b) fis Cartesian in E implies that qfis a pullback in B. This notion captures many structures which are used to describe type dependency (like display-map categories (Tayl...

The paper addresses the question of when the least-xed-point operator, in a cartesian closed category of domains, is characterised as the unique dinatural transformation from the exponentiation bifunctor to the identity functor. We give a suucient condition on a cartesian closed full subcategory of the category of algebraic cpos for the characterisation to hold. The condition is quite mild, and...