Abstract

A generalization of positive inductive and coinductive types to monotone inductive and coinductive constructors of rank 1 and rank 2 is described. The motivation is taken from initial algebras and nal coalgebras in a functor category and the Curry-Howard-correspondence. The denition of the system as a -calculus requires an appropriate denition of monotonicity to overcome subtle problems, most notably to ensure that the (co-)inductive constructors introduced via monotonicity of the underlying constructor of rank 2 are also monotone as constructors of rank 1. The problem is solved, strong normalization shown, and the notion proven to be wide enough to cover even highly complex datatypes. 1

Citations

220	Interprétation fonctionnelle et élimination des coupures de l’arithmétique d’ordre supérieur - Girard - 1972
81	Inductive Types and Type Constraints in the Second-Order Lambda Calculus. Annals of pure and Applied logic 51 - Mendler - 1991
68	Monadic presentations of lambda terms using generalized inductive types - Altenkirch, Reus - 1999
62	De Bruijn notation as a nested datatype - Bird, Paterson - 1999
49	Inductive and Coinductive Types with Iteration and Recursion - Geuvers - 1992
31	Contracting proofs to programs - Leivant - 1990
28	Generalised folds for nested datatypes - Bird, Paterson - 1999
27	From fast exponentiation to square matrices: an adventure in types - Okasaki - 1999
26	equality for coproducts - Ghani
21	Extensions of System F by Iteration and Primitive Recursion on Monotone Inductive Types - Matthes - 1998
14	Fixed Points and Extensionality in Typed Functional Programming Languages - Howard - 1992
3	Representations of order function types as terminal coalgebras - Altenkirch - 2001
3	De Inductives en Theorie des Types d'Ordre Superieur. Habilitation a diriger les recherches - Paulin-Mohring - 1996
1	Category theory as coherently constructive lattice theory: An illustration - Backhouse, Bijsterveld - 1994