Mixed inductive/coinductive types and strong normalization

Authors:
Andreas Abel
Affiliations:
Department of Computer Science, University of Munich, München, Germany
Venue:
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Year:
2007

Citing 14
Cited 3

Recursive programming with proofs

Theoretical Computer Science - Special issue on discrete mathematics and applications to computer science
Proving the correctness of reactive systems using sized types

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
Type-based termination of recursive definitions

Mathematical Structures in Computer Science
Iteration and coiteration schemes for higher-order and nested datatypes

Theoretical Computer Science - Foundations of software science and computation structures
Continuous Functions on Final Coalgebras

Electronic Notes in Theoretical Computer Science (ENTCS)
On the stability by union of reducibility candidates

FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Strong normalization and equi-(co)inductive types

TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
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
Polarized subtyping for sized types

CSR'06 Proceedings of the First international computer science conference on Theory and Applications
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

Subtyping, declaratively: an exercise in mixed induction and coinduction

MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
Programming with binders and indexed data-types

POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Copatterns: programming infinite structures by observations

POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce the concept of guarded saturated sets, saturated sets of strongly normalizing terms closed under folding of corecursive functions. Using this tool, we can model equi-inductive and equi-coinductive types with terminating recursion and corecursion principles. Two type systems are presented: Mendler (co)iteration and sized types. As an application we show that we can directly represent the mixed inductive/ coinductive type of stream processors with associated recursive operations.