Datatype Laws without Signatures (1996)

by Maarten M. Fokkinga
Citations:22 - 6 self

Active Bibliography

4 Calculate Categorically! – Maarten Fokkinga - 1992
19 Monadic Maps and Folds for Arbitrary Datatypes – Maarten Fokkinga - 1994
95 Bananas in Space: Extending Fold and Unfold to Exponential Types – Erik Meijer, Graham Hutton - 1995
41 Calculate Polytypically! – Lambert Meertens - 1996
Submitted to ICFP’13 Unifying Recursion Schemes – Ralf Hinze, Nicolas Wu, Jeremy Gibbons
6 A Relational Approach To Optimization Problems – Sharon Curtis - 1996
Towards a Theory of Moa – Maarten Fokkinga - 2000
Generic Accumulations for Program Calculation – Mauro Jaskelioff - 2004
1 Category Theory as Coherently Constructive Lattice Theory – Roland Backhouse, Marcel Bijsterveld, Rik van Geldrop, Jaap Van Der Woude - 1998
14 Fusion of Recursive Programs with Computational Effects – Alberto Pardo - 2000
28 Polytypic Pattern Matching – Johan Jeuring - 1995
5 Functional polytypic programming | use and implementation – Patrik Jansson - 1997
16 Calculating Accumulations – Zhenjiang Hu, Hideya Iwasaki, Masato Takeichi - 1999
93 Polytypic programming – Patrik Jansson - 2000
5 Mathematics of Recursive Program Construction – Henk Doornbos, Roland Backhouse - 2001
20 Comparing Libraries for Generic Programming in Haskell – Alexey Rodriguez, Johan Jeuring, Patrik Jansson, Alex Gerdes, Oleg Kiselyov, Bruno C. d. S. Oliveira - 2008
4 Inductive Datatypes with Laws and Subtyping – A Relational Model – Theodorus Sebastiaan Voermans
5 A Calculational Approach to Strong Datatypes – Alberto Pardo - 1997
34 Generalised Folds for Nested Datatypes – Richard Bird, Ross Paterson - 1999