Computational lambda-calculus and monads
Proceedings of the Fourth Annual Symposium on Logic in computer science
Handbook of logic in computer science (vol. 2)
Term rewriting and all that
Theoretical Computer Science
Word Processing in Groups
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
A Two-Category Approach to Critical Pair Completion
Proceedings of the 7th Workshop on Abstract Data Types: Recent Trends in Data Type Specification
Category Theory and Computer Science
Monads and Modular Term Rewriting
CTCS '97 Proceedings of the 7th International Conference on Category Theory and Computer Science
A Categorical Formulation for Critical-Pair/Completion Procedures
CTRS '92 Proceedings of the Third International Workshop on Conditional Term Rewriting Systems
A Stability Theorem in Rewriting Theory
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Abstract Syntax and Variable Binding
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in 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
Substitution in non-wellfounded syntax with variable binding
Theoretical Computer Science - Selected papers of CMCS'03
An initial algebra approach to term rewriting systems with variable binders
Higher-Order and Symbolic Computation
On the construction of free algebras for equational systems
Theoretical Computer Science
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Equational systems and free constructions
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
This paper introduces a semantics for rewriting that is independent of the data being rewritten and which, nevertheless, models key concepts such as substitution which are central to rewriting algorithms. We demonstrate the naturalness of this construction by showing how it mirrors the usual treatment of algebraic theories as coequalizers of monads. We also demonstrate its naturalness by showing how it captures several canonical forms of rewriting.