Active Bibliography

8 (Co-)iteration for higher-order nested datatypes – Andreas Abel, Ralph Matthes - 2003
10 Monotone Inductive and Coinductive Constructors of Rank 2 – Ralph Matthes - 2001
5 Type-based termination of generic programs – Andreas Abel - 2007
Monotone (Co)Inductive Types and Positive Fixed-Point Types – Ralph Matthes - 1998
4 Coding Recursion a la Mendler (Extended Abstract) – Tarmo Uustalu, Varmo Vene - 2000
10 Semi-continuous sized types and termination – Andreas Abel
7 Implementing a normalizer using sized heterogeneous types – Andreas Abel - 2006
4 Generic Operations on Nested Datatypes – Ian Bayley - 2001
29 General recursion via coinductive types – Venanzio Capretta
Least and Greatest Fixed Points in Intuitionistic Natural Deduction – Tarmo Uustalu, Varmo Vene - 2002
39 Type-Based Termination of Recursive Definitions – G. Barthe, M. J. Frade, E. Giménez, L. Pinto, T. Uustalu - 2002
3 Practical Inference for Typed-Based Termination in a Polymorphic Setting – Gilles Barthe, Benjamin Gregoire, Fernando Pastawski
7 Fixed points of type constructors and primitive recursion – Andreas Abel, Ralph Matthes - 2004
4 Disciplined, efficient, generalised folds for nested datatypes – Clare Martin, Jeremy Gibbons, Ian Bayley
Substitution in non-wellfounded . . . – Ralph Matthes, Tarmo Uustalu - 2003
2 The Recursion Scheme from the Cofree Recursive Comonad – Tarmo Uustalu, Varmo Vene
8 Initial algebra semantics is enough – Patricia Johann, Neil Ghani - 2007
Haskell Programming with Nested Types: A Principled Approach † – Patricia Johann, Neil Ghani
65 Generic Haskell: practice and theory – Ralf Hinze, Johan Jeuring - 2003