Terms and infinite trees as monads over a signature (original) (raw)
Related papers
The formal theory of monads II
Journal of Pure and Applied Algebra, 2002
A Description of Iterative Reflections of Monads (Extended Abstract)
Lecture Notes in Computer Science, 2009
Logical Relations for Monadic Types
Lecture Notes in Computer Science, 2002
Equational properties of iterative monads
Information and Computation, 2010
Powersets of terms and composite monads
Fuzzy Sets and Systems, 2007
Tree algebras and varieties of tree languages
Theoretical Computer Science, 2007
Variations on Algebra: Monadicity and Generalisations of Equational Therories
Formal Aspects of Computing, 2002
Nested semantics over finite trees are equationally hard
Information and Computation, 2004
Finite equational bases in process algebra: Results and open questions
Processes, Terms and Cycles: Steps on the Road to Infinity, 2005
Expressiveness of Monadic Second-Order Logics on Infinite Trees of Arbitrary Branching Degree
2012
Using monads to fuse recursive programs
Notions of Computation Determine Monads
2002
On Rational Monads and Free Iterative Theories
Electronic Notes in Theoretical Computer Science, 2003
Infinite trees and completely iterative theories: a coalgebraic view
Theoretical Computer Science, 2003
Monadic Monadic Second Order Logic
2022
Monads with arities and their associated theories
Journal of Pure and Applied Algebra, 2012
Process Algebra as Abstract Data Types
arXiv (Cornell University), 2010
Notions of computation and monads
Information and Computation, 1991
CIA Structures and the Semantics of Recursion
Lecture Notes in Computer Science, 2010
Abstract GSOS Rules and a Modular Treatment of Recursive Definitions
Logical Methods in Computer Science, 2013
Mathematical Structures in Computer Science, 2014
2014
The formal theory of monoidal monads
Journal of Pure and Applied Algebra, 2012
From Semantics to Types: the Case of the Imperative λ -Calculus
2021
The importance of the left merge operator in process algebras
Lecture Notes in Computer Science, 1990
Presenting Functors by Operations and Equations
Luca Aceto, Marcello Bonsangue
Lecture Notes in Computer Science, 2006
From Semantics to Types: the Case of the Imperative lambda-Calculus
Electronic Proceedings in Theoretical Computer Science, 2021
An abstract monadic semantics for value recursion
RAIRO - Theoretical Informatics and Applications, 2004
Finitely Branching LTS’s from Reaction Semantics for Process Calculi
Categorical Syntax and Consequence Relations
2021
Completely iterative algebras and completely iterative monads
Information and Computation, 2005
A characterization of lambda definable tree operations
Information and Computation/information and Control, 1990