Practical Inference for Typed-Based Termination in a Polymorphic Setting
by
Gilles Barthe
,
Benjamin Gregoire
,
Fernando Pastawski
| Citations: | 3 - 0 self |
BibTeX
@MISC{Barthe_practicalinference,
author = {Gilles Barthe and Benjamin Gregoire and Fernando Pastawski},
title = {Practical Inference for Typed-Based Termination in a Polymorphic Setting},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We introduce a polymorphic #-calculus that features inductive types and that enforces termination of recursive definitions through typing. Then, we define a sound and complete type inference algorithm that computes a set of constraints to be satisfied for terms to be typable.
