Add to ORKGAbstract. Type-based termination is a method to enforce termination of recursive definitions through a non-standard type system that intro-duces a notion of size for inhabitants of inductively defined types. The purpose of this tutorial is to provide a gentle introduction to a polymor-phically typed λ-calculus with type-based termination, and to the size inference algorithm which is used to guarantee automatically termination of recursive definitions.
This paper proposes a type-and-effect system called T eq ↓ , which distinguishes terminating terms a...
This paper proposes a type-and-effect system called Teq↓, which distinguishes terminating terms and ...
Recursion (Technical Appendix) This paper proposes a type-and-effect system called Teq↓, which disti...
AbstractInstances of a polytypic or generic program for a concrete recursive type often exhibit a re...
Abstract. Type-based termination is a semantically intuitive method that ensures termination of recu...
The paradigm of type-based termination is explored for functional programming with recursive data t...
The paradigm of type-based termination is explored for functional programming with recursive data ty...
The paradigm of type-based termination is explored for functional programming with recursive data ty...
Abstract. A type-based approach to termination uses sized types: an ordinal bound for the size of a ...
The paradigm of type-based termination is explored for functional programming with recursive data t...
Some type-based approaches to termination use sized types: an ordinal boundfor the size of a data st...
Abstract. Giménez ’ type system for structural recursion in the Calculus of Constructions is adapted...
This paper introduces "lambda-hat", a simply typed lambda calculus supporting inductive types an...
This paper proposes a type-and-effect system called Teqt, which distinguishes terminating terms and ...
Recursion (Technical Appendix) This paper proposes a type-and-effect system called Teq↓, which disti...
This paper proposes a type-and-effect system called T eq ↓ , which distinguishes terminating terms a...
This paper proposes a type-and-effect system called Teq↓, which distinguishes terminating terms and ...
Recursion (Technical Appendix) This paper proposes a type-and-effect system called Teq↓, which disti...
AbstractInstances of a polytypic or generic program for a concrete recursive type often exhibit a re...
Abstract. Type-based termination is a semantically intuitive method that ensures termination of recu...
The paradigm of type-based termination is explored for functional programming with recursive data t...
The paradigm of type-based termination is explored for functional programming with recursive data ty...
The paradigm of type-based termination is explored for functional programming with recursive data ty...
Abstract. A type-based approach to termination uses sized types: an ordinal bound for the size of a ...
The paradigm of type-based termination is explored for functional programming with recursive data t...
Some type-based approaches to termination use sized types: an ordinal boundfor the size of a data st...
Abstract. Giménez ’ type system for structural recursion in the Calculus of Constructions is adapted...
This paper introduces "lambda-hat", a simply typed lambda calculus supporting inductive types an...
This paper proposes a type-and-effect system called Teqt, which distinguishes terminating terms and ...
Recursion (Technical Appendix) This paper proposes a type-and-effect system called Teq↓, which disti...
This paper proposes a type-and-effect system called T eq ↓ , which distinguishes terminating terms a...
This paper proposes a type-and-effect system called Teq↓, which distinguishes terminating terms and ...
Recursion (Technical Appendix) This paper proposes a type-and-effect system called Teq↓, which disti...