Adding recursive constructs to bialgebraic semantics
- 1 July 2004
- journal article
- Published by Elsevier in The Journal of Logic and Algebraic Programming
- Vol. 60-61, 259-286
- https://doi.org/10.1016/j.jlap.2004.03.005
Abstract
No abstract availableKeywords
Funding Information
- Danmarks Grundforskningsfond
This publication has 7 references indexed in Scilit:
- Towards Weak Bisimulation For CoalgebrasElectronic Notes in Theoretical Computer Science, 2002
- Well-behaved Translations between Structural Operational SemanticsElectronic Notes in Theoretical Computer Science, 2002
- A Coalgebraic View of Infinite Trees and IterationElectronic Notes in Theoretical Computer Science, 2001
- Distributivity for endofunctors, pointed and co-pointed endofunctors, monads and comonadsElectronic Notes in Theoretical Computer Science, 2000
- Bisimulation can't be tracedJournal of the ACM, 1995
- A domain equation for bisimulationInformation and Computation, 1991
- Initial Algebra Semantics and Continuous AlgebrasJournal of the ACM, 1977