When is a function a fold or an unfold (2001)

by Jeremy Gibbons , Graham Hutton , Thorsten Altenkirch
Venue:Coalgebraic Methods in Computer Science, number 44.1 in Electronic Notes in Theoretical Computer Science
Citations:8 - 3 self

Documents Related by Co-Citation

42 A tutorial on the universality and expressiveness of fold – Graham Hutton - 1999
274 Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire – Erik Meijer, Maarten Fokkinga, Ross Paterson - 1991
63 Generic Haskell: practice and theory – Ralf Hinze, Johan Jeuring - 2003
67 Nested datatypes – Richard Bird, Lambert Meertens - 1998
64 Functional Programming with Overloading and Higher-Order Polymorphism – Mark P. Jones - 1995
4648 Design Patterns: Elements of Reusable Object-Oriented Software – Erich Gamma, Richard Helm, Ralph Johnson, John Vlissides - 1994
15 Monadic Maps and Folds for Arbitrary Datatypes – Maarten Fokkinga - 1994
12 Tupling and mutumorphisms – Maarten M Fokkinga - 1990
10 Design Patterns as Higher-Order Datatype-Generic Programs – Jeremy Gibbons - 2006
114 Implementing Type Classes – John Peterson, Mark Jones
34 Datatype-generic programming – Jeremy Gibbons
161 PolyP - a polytypic programming language extension – Patrik Jansson, Johan Jeuring - 1997
74 98 Language and Libraries. The Revised Report – S Peyton Jones - 2003
196 Functional Data Structures – Chris Okasaki - 1996
28 Generalised Folds for Nested Datatypes – Richard Bird, Ross Paterson - 1999
292 Theorems for free! – Philip Wadler - 1989
26 Dealing with Large Bananas – Ralf Lammel, Joost Visser, Jan Kort - 2000
67 Dependency-style Generic Haskell – Andres Löh, Dave Clarke, Johan Jeuring - 2003
651 Notions of Computation and Monads – Eugenio Moggi - 1991