Monads of coalgebras: rational terms and term graphs

Authors:
Neil Ghani;Christoph Lüth;Federico De Marchi
Affiliations:
Department of Mathematics and Computer Science, University of Leicester;FB 3 – Mathematik und Informatik, Universität Bremen;Department of Mathematics and Computer Science, University of Leicester
Venue:
Mathematical Structures in Computer Science
Year:
2005

Citing 5
Cited 2

Parametric corecursion

Theoretical Computer Science
Monads and Modular Term Rewriting

CTCS '97 Proceedings of the 7th International Conference on Category Theory and Computer Science
A 2-Categorical Presentation of Term Graph Rewriting

CTCS '97 Proceedings of the 7th International Conference on Category Theory and Computer Science
Abstract Syntax and Variable Binding

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Free iterative theories: a coalgebraic view

Mathematical Structures in Computer Science

Recursive Program Schemes and Context-Free Monads

Electronic Notes in Theoretical Computer Science (ENTCS)
Abstract modularity

RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces guarded and strongly guarded monads as a unified model of a variety of different term algebras covering fundamental examples such as initial algebras, final coalgebras, rational terms and term graphs. We develop a general method for obtaining finitary guarded monads that allows us to define and prove properties of the rational and term graph monads. Furthermore, our treatment of rational equations extends the traditional approach to allow right-hand sides of equations to be infinite terms, term graphs or other such coalgebraic structures. As an application, we use these generalised rational equations to sketch part of the correctness of the term graph implementation of functional programming languages.