We give an analysis of classes of recursive types by presenting two extensions of the simply-typed lambda calculus. The first language only allows recursive types with built-in principles of well-founded induction, while the second allows more general recursive types which permit non-terminating computations. We discuss the expressive power of the languages, examine the properties of reduction-based operational semantics for them, and give examples of their use in expressing iteration over large ordinals and in simulating both call-by-name and call-by-value versions of the untyped lambda calculus. The motivations for this wor
The paradigm of type-based termination is explored for functional programming with recursive data ty...
We consider the interaction of recursion with extensional data types in several typed functional pro...
Abstract In the simply-typed lambda-calculus, a hereditary substitution replaces a free variablein a...
We give an analysis of classes of recursive types by presenting two extensions of the simply-typed l...
) Brian T. Howard Department of Computer and Information Sciences Kansas State University bhoward@c...
The paper introduces λ ̂ , a simply typed lambda calculus supporting inductive types and recursive f...
This paper introduces "lambda-hat", a simply typed lambda calculus supporting inductive types an...
Recursive types extend the simply-typed lambda calculus (STLC) with the additional expressive power ...
Recursive types are added to the first- and second-order lambda calculi and the resulting typed ter...
AbstractThe language Fun [13] is a typed polymorphic lambda calculus with a notion of subtyping and ...
The type theories we consider are adequate for the foundations of mathematics and computer science....
We investigate the interactions of subtyping and recursive types, in a simply typed lambda-calculus....
Abstract: "We define the notion of an inductively defined type in the Calculus of Constructions and ...
International audienceWe study isomorphisms of inductive types (that is, recursive types satisfying ...
AbstractA relation between recursive object types, called matching, has been proposed [8] to provide...
The paradigm of type-based termination is explored for functional programming with recursive data ty...
We consider the interaction of recursion with extensional data types in several typed functional pro...
Abstract In the simply-typed lambda-calculus, a hereditary substitution replaces a free variablein a...
We give an analysis of classes of recursive types by presenting two extensions of the simply-typed l...
) Brian T. Howard Department of Computer and Information Sciences Kansas State University bhoward@c...
The paper introduces λ ̂ , a simply typed lambda calculus supporting inductive types and recursive f...
This paper introduces "lambda-hat", a simply typed lambda calculus supporting inductive types an...
Recursive types extend the simply-typed lambda calculus (STLC) with the additional expressive power ...
Recursive types are added to the first- and second-order lambda calculi and the resulting typed ter...
AbstractThe language Fun [13] is a typed polymorphic lambda calculus with a notion of subtyping and ...
The type theories we consider are adequate for the foundations of mathematics and computer science....
We investigate the interactions of subtyping and recursive types, in a simply typed lambda-calculus....
Abstract: "We define the notion of an inductively defined type in the Calculus of Constructions and ...
International audienceWe study isomorphisms of inductive types (that is, recursive types satisfying ...
AbstractA relation between recursive object types, called matching, has been proposed [8] to provide...
The paradigm of type-based termination is explored for functional programming with recursive data ty...
We consider the interaction of recursion with extensional data types in several typed functional pro...
Abstract In the simply-typed lambda-calculus, a hereditary substitution replaces a free variablein a...