Generalized Iteration and Coiteration for Higher-Order Nested Datatypes

Generalized Iteration and Coiteration for Higher-Order Nested Datatypes (2003)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Andreas Abel , Ralph Matthes , Tarmo Uustalu , Programmes Et Systemes

Citations:

8 - 5 self

BibTeX

@MISC{Abel03generalizediteration,
    author = {Andreas Abel and Ralph Matthes and Tarmo Uustalu and Programmes Et Systemes},
    title = {Generalized Iteration and Coiteration for Higher-Order Nested Datatypes},
    year = {2003}
}

Bookmark

OpenURL

Abstract

We solve the problem of extending Bird and Paterson's generalized folds for nested datatypes and its dual to inductive and coinductive constructors of arbitrarily high ranks by appropriately generalizing Mendler-style (co)iteration. Characteristically to Mendler-style schemes of disciplined (co)recursion, the schemes we propose do not rest on notions like positivity or monotonicity of a constructor and facilitate programming in a natural and elegant style close to programming with the customary letrec construct, where the typings of the schemes, however, guarantee termination. For rank 2, a smoothened version of Bird and Paterson's generalized folds and its dual are achieved; for rank 1, the schemes instantiate to Mendler's original (re)formulation of iteration and coiteration. Several examples demonstrate the power of the approach.

Citations

474	Lambda Calculi with Types - Barendregt - 1992
395	The formulae-as-types notion of construction - Howard - 1980
221	Interprétation fonctionnelle et élimination des coupures de l’arithmétique d’ordre supérieur. Thèse de Doctorat d’ État, Université de Paris VII - Girard - 1972
182	Categories for the working mathematician, volume 5 of Graduate Texts - Lane
102	Polytypic Values Possess Polykinded Types - Hinze - 2000
68	Monadic presentations of lambda terms using generalized inductive types - Altenkirch, Reus - 1999
67	Nested datatypes - Bird, Meertens - 1998
62	De Bruijn notation as a nested datatype - Bird, Paterson - 1999
49	Inductive and Coinductive Types with Iteration and Recursion - Geuvers - 1992
45	Generic programming within dependently typed programming - Altenkirch, McBride - 2003
45	A typed lambda calculus with categorical type constructors - Hagino - 1987
31	Contracting proofs to programs - Leivant - 1990
30	Type-based termination of recursive definitions - Barthe, Frade, et al.
28	Generalised folds for nested datatypes - Bird, Paterson - 1999
28	Structural recursive definitions in type theory - Giménez - 1998
25	2004, Termination Checking with Types - Abel
21	Extensions of System F by Iteration and Primitive Recursion on Monotone Inductive Types - Matthes - 1998
9	Structural recursive de in type theory - Gimenez - 1998
9	Efficient generalized folds - Hinze - 2000
9	Monotone inductive and coinductive constructors of rank 2 - Matthes - 2001
8	Co-)iteration for higher-order nested datatypes - Abel, Matthes - 2003
7	Program optimisation, naturally - Bird, Gibbons, et al. - 2000
3	Type-based termination of recursive de - Barthe, Frade, et al. - 2004
3	Representations of order function types as terminal coalgebras - Altenkirch - 2001
1	Efficient generalized folds - Coll - 1998
1	examples for iteration and coiteration on higher-order datatypes. Haskell code accompanying this article, available on the author's homepage - Haskell - 2003