The Generic Approximation Lemma (2001)

Cached

Download Links

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

Documents Related by Co-Citation

215 Introduction to Functional Programming using Haskell – R Bird - 1998
299 Programming with bananas, lenses, envelopes and barbed wire – Erik Meijer, Maarten Fokkinga, Ross Paterson - 1991
326 Theorems for free! – Philip Wadler - 1989
36 Free Theorems in the Presence of seq – Patricia Johann, Janis Voigtländer - 2004
96 and Oege de Moor. Algebra of Programming – Richard Bird - 1997
3 Iteration Monads – Peter Aczel Jiri Adamek, Jiri Velebil, Peter Aczel, X Ty - 2000
4 Terminal algebras in well-founded set theory – M Barr - 1993
3 Equational axiomatisability for coalgebra – G Rosu - 2000
11 An algebra-coalgebra framework for system specification – C Cîrstea - 2007
19 A presentation of topoi as algebraic relative to categories or graphs – E J Dubuc, G M Kelly - 1983
20 Monads and Modular Term Rewriting – Christoph Lüth, Neil Ghani - 1997
9 Compositional Term Rewriting: An Algebraic Proof of Toyama's Theorem – Christoph Lüth - 1996
43 Elementary observations on 2-categorical limits – G M Kelly - 1989
21 An Axiomatics for Categories of Coalgebras – John Power, Hiroshi Watanabe - 1998
25 Variations on Algebra: monadicity and generalisations of equational theories – Edmund Robinson - 2001
53 Functorial Operational Semantics and its Denotational Dual – D Turi - 1996
58 Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads, Journal of pure and applied algebra 89 – M Kelly, J Power - 1993
10 On final coalgebras of continuous functors – J Adámek
142 Abstract syntax and variable binding – M P Fiore, G D Plotkin, D Turi - 1999