Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
Natural Transformations as Rewrite Rules and Monad Composition
Saved in:
| Published in: | Logical Methods in Computer Science |
|---|---|
| Format: | Online Article RSS Article |
| Published: |
2019
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
Similar Items: Natural Transformations as Rewrite Rules and Monad Composition
- Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics
- Termination of Rewriting with Right-Flat Rules Modulo Permutative Theories
- Transforming Outermost into Context-Sensitive Rewriting
- A Lower Bound of the Number of Rewrite Rules Obtained by Homological Methods
- Corecursive Algebras, Corecursive Monads and Bloom Monads
- Termination of Cycle Rewriting by Transformation and Matrix Interpretation