1 Introduction The study of type isomorphisms is concerned with identifying data types by abstract-ing away from irrelevant details in the syntax of types, or--in other words--irrelevant choices in the representation of data. The basic idea is quite simple: one wishes to iden-tify two data types if data of one type can be transformed into data of the other type without loss of information. Formally speaking, o/1 and o/2 are said to be isomorphic ifand only if there exist functions f: o/1! o/2 and g: o/2! o/1 that are mutual inverses,in the sense that they make the following diagram commute
This thesis describes techniques for efficiently performing polymorphic type inference for function...
A type may be a subtype of another type. The intuition about this should be clear: a type is a type ...
AbstractWe study a variant of System F≤ that integrates and generalizes several existing proposals f...
International audienceThis work sets the formal bases for building tools that help retrieve classes ...
We investigate the interactions of subtyping and recursive types, in a simply typed λ-calculus. The ...
We relate standard techniques for solving recursive domain equations to previous models with types i...
AbstractEquality and subtyping of recursive types were studied in the 1990s by Amadio and Cardelli; ...
Abstract. Many type inference and program analysis systems include notions of subtyping and parametr...
Many type inference and program analysis systems include notions of subtyping and parametric polymor...
. Higher-order programming languages, such as ML, permit a flexible programming style by using compi...
Inheritance in the form of subtyping is considered in the framework of a polymorphic type discipline...
In this paper we present a new approach to the semantics of data types, in which the types themselve...
What is the right notion of "isomorphism" between types, in a simple type theory? The traditional an...
Modem functional languages feature polymorphic types whose data structures must be fixed, though the...
Well-known techniques exist for proving the soundness of subtyping relations with respect to type sa...
This thesis describes techniques for efficiently performing polymorphic type inference for function...
A type may be a subtype of another type. The intuition about this should be clear: a type is a type ...
AbstractWe study a variant of System F≤ that integrates and generalizes several existing proposals f...
International audienceThis work sets the formal bases for building tools that help retrieve classes ...
We investigate the interactions of subtyping and recursive types, in a simply typed λ-calculus. The ...
We relate standard techniques for solving recursive domain equations to previous models with types i...
AbstractEquality and subtyping of recursive types were studied in the 1990s by Amadio and Cardelli; ...
Abstract. Many type inference and program analysis systems include notions of subtyping and parametr...
Many type inference and program analysis systems include notions of subtyping and parametric polymor...
. Higher-order programming languages, such as ML, permit a flexible programming style by using compi...
Inheritance in the form of subtyping is considered in the framework of a polymorphic type discipline...
In this paper we present a new approach to the semantics of data types, in which the types themselve...
What is the right notion of "isomorphism" between types, in a simple type theory? The traditional an...
Modem functional languages feature polymorphic types whose data structures must be fixed, though the...
Well-known techniques exist for proving the soundness of subtyping relations with respect to type sa...
This thesis describes techniques for efficiently performing polymorphic type inference for function...
A type may be a subtype of another type. The intuition about this should be clear: a type is a type ...
AbstractWe study a variant of System F≤ that integrates and generalizes several existing proposals f...