The dual of substitution is redecoration
Trends in functional programming
Recursion and corecursion have the same equational logic
Theoretical Computer Science - Category theory and computer science
Infinite trees and completely iterative theories: a coalgebraic view
Theoretical Computer Science
Free iterative theories: a coalgebraic view
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Explicit substitutions and higher-order syntax
MERLIN '03 Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
Nordic Journal of Computing
Theoretical Computer Science - Logic, semantics and theory of programming
Substitution in non-wellfounded syntax with variable binding
Theoretical Computer Science - Selected papers of CMCS'03
Completely iterative algebras and completely iterative monads
Information and Computation
A general final coalgebra theorem
Mathematical Structures in Computer Science
Monads of coalgebras: rational terms and term graphs
Mathematical Structures in Computer Science
Recursive coalgebras from comonads
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Distributive laws for the coinductive solution of recursive equations
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Explicit substitutions and higher-order syntax
Higher-Order and Symbolic Computation
Terminal coalgebras and free iterative theories
Information and Computation
The category-theoretic solution of recursive program schemes
Theoretical Computer Science - Algebra and coalgebra in computer science
Recursive Coalgebras from Comonads
Electronic Notes in Theoretical Computer Science (ENTCS)
Relating Two Approaches to Coinductive Solution of Recursive Equations
Electronic Notes in Theoretical Computer Science (ENTCS)
State Dependent IO-Monads in Type Theory
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Completely iterative algebras and completely iterative monads
Information and Computation
Recursive coalgebras from comonads
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Distributive laws for the coinductive solution of recursive equations
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Recursive Program Schemes and Context-Free Monads
Electronic Notes in Theoretical Computer Science (ENTCS)
Equational properties of iterative monads
Information and Computation
Elgot theories: A new perspective on the equational properties of iteration
Mathematical Structures in Computer Science
Equational logic of recursive program schemes
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
The category theoretic solution of recursive program schemes
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
The power of parameterization in coinductive proof
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
| Hi-index | 5.23 |