Termination and productivity checking with continuous types

Authors:
Andreas Abel
Affiliations:
Department of Computer Science, University of Munich, München, Germany
Venue:
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Year:
2003

Citing 13
Cited 5

Infinite objects in type theory

TYPES '93 Proceedings of the international workshop on Types for proofs and programs
Proving the correctness of reactive systems using sized types

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Recursion and dynamic data-structures in bounded space: towards embedded ML programming

Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
The size-change principle for program termination

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Dependent Types for Program Termination Verification

Higher-Order and Symbolic Computation
Ensuring Streams Flow

AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
Codifying Guarded Definitions with Recursive Schemes

TYPES '94 Selected papers from the International Workshop on Types for Proofs and Programs
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
Data Types, Infinity and Equality in System AF2

CSL '93 Selected Papers from the 7th Workshop on Computer Science Logic
Walther Recursion

CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Termination and Reduction Checking for Higher-Order Logic Programs

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Type-based termination of recursive definitions

Mathematical Structures in Computer Science
A predicative analysis of structural recursion

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
Semi-continuous sized types and termination

CSL'06 Proceedings of the 20th 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
Circular coinduction in coq using bisimulation-up-to techniques

ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving

Quantified Score

Hi-index	0.01

Visualization

Abstract

We analyze the interpretation of inductive and coinductive types as sets of strongly normalizing terms and isolate classes of types with certain continuity properties. Our result enables us to relax some side conditions on the shape of recursive definitions which are accepted by the type-based termination calculus of Barthe, Frade, Giménez, Pinto and Uustalu, thus enlarging its expressivity.