Recursive types are present in most programming languages, since they pro- vide a means of typing recursive functions and data structures. Subtyping is also present in many languages and is especially important in object-oriented languages as a means of typing functions in the presence of inheritance and late binding.
Abstract. We investigate the interactions of subtyping and recursive types, in a simply typed λ-calculus. The two fundamental questions here are whether two ...
The most widely used subtyping rules for recursive types are the Amber rules [Cardelli 1985], which consist of three rules: rule S-amber, rule S-assmp and rule ...
We investigate the interactions of subtyping and recursive types, in a simply typed λ-calculus. The two fundamental questions here are whether two ...
People also ask
What are recursive data types?
What are the different types of recursive definitions?
What is subtyping in programming?
What is the difference between Isorecursive and Equirecursive?
Subtyping Recursive Types. • The correct rule. • We add as an assumption that the type variables stand for types with the desired subtype relationship.
Jul 1, 2024 · This paper proposes a generalization of iso-recursive types called full iso-recursive types. Full iso-recursive types allow encoding all programs with equi- ...
The research on subtyping recursive types seems to have fo- cused more on equi-recursive than iso-recursive systems. For exam- ple, Amadio and Cardelli ...
Abstract. Subtyping is an inclusion relation between types that is present to some degree in many programming languages. Subtyping is especially important.
This paper studies the problem of subtype checking for recursive types in system kernel Fun, a typed /spl lambda/-calculus with subtyping and bounded second ...
This paper aims to revisit the problem of subtyping iso-recursive types. We start by introducing a novel declarative specification for Amber-style iso-recursive ...