AbstractThis paper introduces coalgebraic monads as a unified model of term algebras covering fundamental examples such as initial algebras, final coalgebras, rational terms and term graphs. We develop a general method for obtaining finitary coalgebraic monads which allows us to generalise the notion of rational term and term graph to categories other than Set. As an application we sketch part of the correctness of the the term graph implementation of functional programming languages
Logic programming, a class of programming languages based on first-order logic, provides simple and ...
AbstractA syntax and semantics of types, terms and formulas for coalgebras of polynomial functors is...
In this article, we provide three coalgebraic characterizations of the class of context-free langua...
This paper introduces guarded and strongly guarded monads as a unified model of a variety of differe...
Universal algebra has long been regarded as a fundamental tool in studying semantics of programming ...
Multi-algebras allow to model nondeterminism in an algebraic framework by interpreting operators as...
Earlier papers argued that term graphs play for the specification of relation-based algebras the sam...
Abstract. In this article, we provide three coalgebraic characterizations of the class of context-fr...
We present a categorical characterization of term graphs (i.e., finite, directed acyclic graphs labe...
Universal algebra has long been regarded as a fundamental tool in studying semantics of programming ...
We show that, for functors with suitable mild restrictions, the initial algebra in the category of s...
textabstractIn the semantics of programming, finite data types such as finite lists, have traditiona...
AbstractIn the semantics of programming, finite data types such as finite lists, have traditionally ...
. Monads can be used to model term rewriting systems by generalising the well-known equivalence betw...
Every variable-free logic program induces a Pf P f -coalgebra on the set of atomic formulae in the p...
Logic programming, a class of programming languages based on first-order logic, provides simple and ...
AbstractA syntax and semantics of types, terms and formulas for coalgebras of polynomial functors is...
In this article, we provide three coalgebraic characterizations of the class of context-free langua...
This paper introduces guarded and strongly guarded monads as a unified model of a variety of differe...
Universal algebra has long been regarded as a fundamental tool in studying semantics of programming ...
Multi-algebras allow to model nondeterminism in an algebraic framework by interpreting operators as...
Earlier papers argued that term graphs play for the specification of relation-based algebras the sam...
Abstract. In this article, we provide three coalgebraic characterizations of the class of context-fr...
We present a categorical characterization of term graphs (i.e., finite, directed acyclic graphs labe...
Universal algebra has long been regarded as a fundamental tool in studying semantics of programming ...
We show that, for functors with suitable mild restrictions, the initial algebra in the category of s...
textabstractIn the semantics of programming, finite data types such as finite lists, have traditiona...
AbstractIn the semantics of programming, finite data types such as finite lists, have traditionally ...
. Monads can be used to model term rewriting systems by generalising the well-known equivalence betw...
Every variable-free logic program induces a Pf P f -coalgebra on the set of atomic formulae in the p...
Logic programming, a class of programming languages based on first-order logic, provides simple and ...
AbstractA syntax and semantics of types, terms and formulas for coalgebras of polynomial functors is...
In this article, we provide three coalgebraic characterizations of the class of context-free langua...
DOI
Add to ORKG