We present a simple extension of typed λ-claculus where functions can be <italic>overloaded</italic> by adding different “pieces of code”. In short, the code of an overloadedâ€¦ (More)

The authors give a formal semantics for the language Bounded Fun, which supports both parametric and subtype polymorphism. They show how to use partial equivalence relations to model inheritance inâ€¦ (More)

A constructive characterization is given of the isomorphisms which must hold in all models of the typed lambda calculus with surjective pairing. By the close relation between closed Cartesianâ€¦ (More)

Mathematical Structures in Computer Science / Volume 1 / Issue 02 / July 1991, pp 215 254 DOI: 10.1017/S0960129500001298, Published online: 04 March 2009 Link to this article:â€¦ (More)

The interest in isomorphisms in models for typed langurges mainly arisees from work done in the study d denotational semantics. This work has led to the notion d solving domain equrtiont as a toolâ€¦ (More)

Quest is a programming language based on impredicative type quantifiers and subtyping within a three-level structure of kinds, types and type operators, and values. The semantics of Quest is ratherâ€¦ (More)