|
17
|
Free iterative theories: A coalgebraic view
– J Adámek, S Milius, J Velebil
|
|
36
|
Infinite trees and completely iterative theories: A coalgebraic view, Theoret
– P Aczel, J Adámek, S Milius, J Velebil
|
|
10
|
Dualising initial algebras
– N Ghani, C Luth, F de Marchi, J Power
|
|
173
|
Jirí Rosicky, Locally Presentable and Accessible Categories
– Jirí Adamek
- 1994
|
|
20
|
Monads and Modular Term Rewriting
– Christoph Lüth, Neil Ghani
- 1997
|
|
12
|
Parametric Corecursion
– Lawrence S. Moss
|
|
6
|
Substitution in Non-wellfounded Syntax with Variable Binding
– Ralph Matthes, Tarmo Uustalu
- 2003
|
|
27
|
On the algebraic structure of rooted trees
– C C Elgot, S L Bloom, R Tindell
- 1978
|
|
4
|
On rational monads and free iterative theories
– J Adámek, S Milius, J Velebil
- 2002
|
|
7
|
Categories of processes enriched in final coalgebras
– S Krstić, J Launchbury, D Pavlović
|
|
7
|
Monads and Modularity
– Christoph Lüth, Neil Ghani
|
|
18
|
Combining Computational Effects: Commutativity and Sum
– Martin Hyland, Gordon Plotkin, John Power
- 2002
|
|
20
|
Abstract syntax and variable binding (extended abstract
– Marcelo Fiore, Gordon Plotkin, Daniele Turi
- 1999
|
|
90
|
Semantical analysis of higher-order abstract syntax
– M Hofmann
|
|
68
|
Monadic Presentations of Lambda Terms Using Generalized Inductive Types
– Thorsten Altenkirch, Bernhard Reus
- 1999
|
|
12
|
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
|
|
401
|
Computational Lambda-Calculus and Monads
– Eugenio Moggi
- 1988
|
|
130
|
Abstract Syntax and Variable Binding
– Marcelo Fiore
- 1999
|
