Coalgebraic Monads (2002)

Cached

Download Links

by Neil Ghani , Christoph Lüth , Federico De Marchi
Citations:7 - 5 self

Documents Related by Co-Citation

19 Free iterative theories: a coalgebraic view – J Adámek, S Milius, J Velebil
41 Infinite trees and completely iterative theories: a coalgebraic view. Theoretical Computer Science – Peter Aczel, Jirí Adámek, Stefan Milius, Jiri Velebil - 2003
11 Dualising initial algebras – N Ghani, C Lüth, F De Marchi, A J Power
196 Locally Presentable and Accessible Categories – Adámek, Rosicky - 1994
20 Monads and Modular Term Rewriting – Christoph Lüth, Neil Ghani - 1997
14 Parametric Corecursion – Lawrence S. Moss
9 Substitution in Non-wellfounded Syntax with Variable Binding – Ralph Matthes, Tarmo Uustalu - 2003
28 The algebraic structure of rooted trees – C Elgot, S L Bloom, R Tindell - 1978
7 Categories of processes enriched in final coalgebras – S Krstić, J Launchbury, D Pavlović
5 On rational monads and free iterative theories – Jirí Adámek, Stefan Milius, Jiri Velebil
7 Monads and Modularity – Christoph Lüth, Neil Ghani
19 Combining Computational Effects: Commutativity and Sum – Martin Hyland, Gordon Plotkin, John Power - 2002
21 Abstract syntax and variable binding (extended abstract – Marcelo Fiore, Gordon Plotkin, Daniele Turi - 1999
77 Monadic Presentations of Lambda Terms Using Generalized Inductive Types – Thorsten Altenkirch, Bernhard Reus - 1999
96 Semantical analysis of higher-order abstract syntax – M Hofmann - 1999
13 Primitive (co)recursion and course-of-values (co)iteration, categorically – Tarmo Uustalu, Varmo Vene - 1999
12 Categorical Term Rewriting: Monads and Modularity – Christoph Lüth - 1998
45 A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves, and so – G M Kelly
439 Computational Lambda-Calculus and Monads – Eugenio Moggi - 1988