The Generic Approximation Lemma (2001)

Cached

Download Links

by Graham Hutton , Jeremy Gibbons
Venue:Information Processing Letters
Citations:13 - 2 self

Active Bibliography

21 Proof Methods for Corecursive Programs – Jeremy Gibbons, Graham Hutton - 1999
14 Design Patterns as Higher-Order Datatype-Generic Programs – Jeremy Gibbons - 2006
3 Domain separation by construction – William Harrison, Mark Tullsen, James Hook - 2003
Towards Merging Recursion and Comonads – Alberto Pardo Instituto, Alberto Pardo - 2000
9 Towards Merging Recursion and Comonads – Alberto Pardo - 2000
14 Fusion of Recursive Programs with Computational Effects – Alberto Pardo - 2000
58 A tutorial on the universality and expressiveness of fold – Graham Hutton - 1999
2 An operational domain-theoretic treatment of recursive types – Weng Kin Ho - 2006
12 Proof Methods for Structured Corecursive Programs – Jeremy Gibbons, Graham Hutton - 1999
Adjoint Folds and Unfolds Or: Scything Through the Thicket of Morphisms – Ralf Hinze
2 Program fusion with paramorphisms – Facundo Domínguez, Alberto Pardo - 2006
7 Programming with inductive and co-inductive types – John Greiner - 1992
Generic Accumulations for Program Calculation – Mauro Jaskelioff - 2004
10 Generic Accumulations – Alberto Pardo - 2002
21 Recursion Schemes from Comonads – Tarmo Uustalu, Varmo Vene, Alberto Pardo - 2001
4 Generic Operations on Nested Datatypes – Ian Bayley - 2001
M. Dowse, A. Butterfield, M. van Eekelen , M. de Mol , R. Plasmeijer – Nijmegen Institute For, M. Dowse, A. Butterfield, M. Van Eekelen, M. De Mol, R. Plasmeijer, Malcolm Dowse
Reasoning about Selective Strictness -- Operational Equivalence, Heaps and Call-by-Need Evaluation, New Inductive Principles – Seyed H. Haeri (Hossein) - 2009
Reusable Monadic Semantics of Logic Programs with Arithmetic Predicates – J. E. Labra Gayo, J. M. Cueva Lovelle, M. C. Luengo Diez, A. Cernuda del Rio, A. Cernuda Del Río - 2001