Practical inference for type-based termination in a polymorphic setting

Authors:
Gilles Barthe;Benjamin Grégoire;Fernando Pastawski
Affiliations:
INRIA Sophia-Antipolis, France;INRIA Sophia-Antipolis, France;FaMAF, Univ. Nacional de Córdoba, Argentina
Venue:
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Year:
2005

Citing 7
Cited 10

Proving the correctness of reactive systems using sized types

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Dependent types in practical programming

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Calculating Sized Types

Higher-Order and Symbolic Computation
Structural Recursive Definitions in Type Theory

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Analysis of a Guard Condition in Type Theory (Extended Abstract)

FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Dependent Types for Program Termination Verification

LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Type-based termination of recursive definitions

Mathematical Structures in Computer Science

Type-Based Termination with Sized Products

CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Type-based termination of generic programs

Science of Computer Programming
Implementing a normalizer using sized heterogeneous types

Journal of Functional Programming
Combining typing and size constraints for checking the termination of higher-order conditional rewrite systems

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
CIC∧: type-based termination of recursive definitions in the calculus of inductive constructions

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Semi-continuous sized types and termination

CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Decidability of type-checking in the calculus of algebraic constructions with size annotations

CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Towards generic programming with sized types

MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
Implementing a normalizer using sized heterogeneous types

MSFP'06 Proceedings of the 2006 international conference on Mathematically Structured Functional Programming
Type-Based Productivity of Stream Definitions in the Calculus of Constructions

LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

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. In addition, we show that Subject Reduction fails in a naive use of typed-based termination for a λ-calculus à la Church, and we propose a general solution to this problem.