(Co-)iteration for higher-order nested datatypes (2003)

by Andreas Abel , Ralph Matthes
Venue:POST-CONF. PROC. OF IST WG TYPES 2ND ANN. MEETING, TYPES'02, LECT. NOTES IN COMPUT. SCI
Citations:8 - 5 self

Active Bibliography

8 Generalized Iteration and Coiteration for Higher-Order Nested Datatypes – Andreas Abel, Ralph Matthes, Tarmo Uustalu - 2003
10 Monotone Inductive and Coinductive Constructors of Rank 2 – Ralph Matthes - 2001
Monotone (Co)Inductive Types and Positive Fixed-Point Types – Ralph Matthes - 1998
4 Generic Operations on Nested Datatypes – Ian Bayley - 2001
10 Semi-continuous sized types and termination – Andreas Abel
39 Type-Based Termination of Recursive Definitions – G. Barthe, M. J. Frade, E. Giménez, L. Pinto, T. Uustalu - 2002
7 Fixed points of type constructors and primitive recursion – Andreas Abel, Ralph Matthes - 2004
4 Coding Recursion a la Mendler (Extended Abstract) – Tarmo Uustalu, Varmo Vene - 2000
4 Disciplined, efficient, generalised folds for nested datatypes – Clare Martin, Jeremy Gibbons, Ian Bayley
Substitution in non-wellfounded . . . – Ralph Matthes, Tarmo Uustalu - 2003
8 Initial algebra semantics is enough – Patricia Johann, Neil Ghani - 2007
Haskell Programming with Nested Types: A Principled Approach † – Patricia Johann, Neil Ghani
5 Representing Cyclic Structures as Nested Datatypes – Neil Ghani, Makoto Hamana, Tarmo Uustalu, Varmo Vene
Theoretical Foundations for Practical ‘Totally Functional Programming’ – Colin Kemp - 2007
2 Monotone Fixed-Point Types and Strong Normalization – Ralph Matthes - 1998
4 Modules over Monads and Linearity – André Hirschowitz, Marco Maggesi
6 A Cube of Proof Systems for the Intuitionistic Predicate mu-,nu-Logic – Tarmo Uustalu, Varmo Vene - 1997
29 General recursion via coinductive types – Venanzio Capretta
Least and Greatest Fixed Points in Intuitionistic Natural Deduction – Tarmo Uustalu, Varmo Vene - 2002