Initial algebra and final coalgebra semantics for concurrency
- 1 January 1994
- book chapter
- Published by Springer Nature
- p. 530-582
- https://doi.org/10.1007/3-540-58043-3_28
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- A final coalgebra theoremPublished by Springer Nature ,2005
- A coinduction principle for recursive data types based on bisimulationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Terminal coalgebras in well-founded set theoryTheoretical Computer Science, 1993
- Solving reflexive domain equations in a category of complete metric spacesJournal of Computer and System Sciences, 1989
- An algebraic characterization of transition system equivalencesInformation and Computation, 1989
- Metric semantics for concurrencyBIT Numerical Mathematics, 1988
- Toposes, Triples and TheoriesPublished by Springer Nature ,1985
- Processes and the denotational semantics of concurrencyInformation and Control, 1982
- Parametrized data types do not need highly constrained parametersInformation and Control, 1982
- Closed CategoriesPublished by Springer Nature ,1966