Practical Inference for Type-Based Termination in a Polymorphic Setting

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. In addition, we show th...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Barthe, Gilles, Grégoire, Benjamin, Pastawski, Fernando
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Computer science control theory systems Constraint System Exact sciences and technology Inductive Type Inference Algorithm Proof Assistant Theoretical computing Typing Rule
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!