Add to ORKGWe investigate the interactions of subtyping and recursive types, in a simply typed lambda-calculus. The two fundamental questions here are whether two (recursive) types are in the subtype relation, and whether a term has a type
AbstractWe define the typed lambda calculus Fω∧ (F-omega-meet), a natural generalization of Girard's...
Recursive types extend the simply-typed lambda calculus (STLC) with the additional expressive power ...
AbstractThe language Fun [13] is a typed polymorphic lambda calculus with a notion of subtyping and ...
We investigate the interactions of subtyping and recursive types, in a simply typed λ-calculus. The ...
Algorithms for checking subtyping between recursive types lie at the core of many programming langua...
Algorithms for checking subtyping between recursive types lie at the core of many programming langua...
We give an analysis of classes of recursive types by presenting two extensions of the simply-typed l...
The problem of defining and checking a subtype relation between recursive types was studied in [AC93...
We give an analysis of classes of recursive types by presenting two extensions of the simply-typed l...
The problem of defining and checking a subtype relation between recursive types was studied in [3] f...
AbstractWe study subtype checking for recursive types in system kernel Fun, a typed λ-calculus with ...
The type theories we consider are adequate for the foundations of mathematics and computer science....
We study subtype checking for recursive types in system kernel Fun, a typed λ-calculus with subtypin...
Subtyping judgments of the polymorphic second-order typed lambda-calculus Fsub extended by recursive...
Subtyping judgments of the polymorphic second-order typed lambda-calculus Fsub extended by recursive...
AbstractWe define the typed lambda calculus Fω∧ (F-omega-meet), a natural generalization of Girard's...
Recursive types extend the simply-typed lambda calculus (STLC) with the additional expressive power ...
AbstractThe language Fun [13] is a typed polymorphic lambda calculus with a notion of subtyping and ...
We investigate the interactions of subtyping and recursive types, in a simply typed λ-calculus. The ...
Algorithms for checking subtyping between recursive types lie at the core of many programming langua...
Algorithms for checking subtyping between recursive types lie at the core of many programming langua...
We give an analysis of classes of recursive types by presenting two extensions of the simply-typed l...
The problem of defining and checking a subtype relation between recursive types was studied in [AC93...
We give an analysis of classes of recursive types by presenting two extensions of the simply-typed l...
The problem of defining and checking a subtype relation between recursive types was studied in [3] f...
AbstractWe study subtype checking for recursive types in system kernel Fun, a typed λ-calculus with ...
The type theories we consider are adequate for the foundations of mathematics and computer science....
We study subtype checking for recursive types in system kernel Fun, a typed λ-calculus with subtypin...
Subtyping judgments of the polymorphic second-order typed lambda-calculus Fsub extended by recursive...
Subtyping judgments of the polymorphic second-order typed lambda-calculus Fsub extended by recursive...
AbstractWe define the typed lambda calculus Fω∧ (F-omega-meet), a natural generalization of Girard's...
Recursive types extend the simply-typed lambda calculus (STLC) with the additional expressive power ...
AbstractThe language Fun [13] is a typed polymorphic lambda calculus with a notion of subtyping and ...