Towards a theory of mathematical operational semantics

Electronic Notes in Theoretical Computer Science

Volumn 82, Issue 1, 2003, Pages 257-272

  Power, John ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; SEMANTICS;

COPRODUCTS; DATA SETS; EQUATIONAL THEORY; OPERATIONAL SEMANTICS;

THEOREM PROVING;

EID: 10444240764     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80643-1     Document Type: Conference Paper

References (14)

1. Adamek J., Koubek V. On the greatest fixed point of a set functor. Theoretical Computer Science. 150:1995;57-75
2. Bartels F. GSOS for Probabilistic Transition Systems. Electronic Notes in Theoretical Computer Science. 65:2002
3. Corradini A., Heckel R., Montanari U. From SOS Specifications to Structured Coalgebras: How to make Bisimulation a Congruence. Electronic Notes in Theoretical Computer Science. 19:1999
4. Fiore M., and D. Turi, Semantics of Name and Value Passing, "Proceedings of 16th Symposium on Logic in Computer Science," IEEE Computer Society Press, 2001, 93-104.
5. Hyland M., G.D. Plotkin, and A.J. Power, Combining effects: sum and tensor, (submitted).
6. Jacobs B., Rutten J. A tutorial on (co)algebras and (co)induction. Bulletin of the European Assocation of Theoretical Computer Science. 62:1997;222-259
7. Kelly G.M. A unified treatment of transfinite constructions for free algebras, free monioids, colimits, associated sheaves, and so on. Bulletin Australian Mathematical Society. 22:1980;1-83
8. Kelly G.M., Power A.J. Adjunctions whose counits are coequalizers, and presentations of finitary monads. Journal of Pure and Applied Algebra. 89:1993;163-179
9. Kick M., Bialgebraic modelling of timed processes, "Proceedings of ICALP 2002," Lecture Notes in Computer Science 2380, 2002, 525-536.
10. Lenisa M., Power A.J., Watanabe H. Distributivity for endofunctors, pointed and co-pointed endofunctors, monads and comonads. Electronic Notes in Theoretical Computer Science. 33:2000
11. Milner R. "Communication and Concurrency," Prentice-Hall International Series in Computer Science. 1989
12. Power A.J., Watanabe H. Combining a monad and a comonad. Theoretical Computer Science. 280:2002;137-162
13. Turi D., and G.D. Plotkin, Towards a mathematical operational semantics, "Proceedings of 12th Symposium on Logic in Computer Science," IEEE Computer Science Press, 1997, 280-291.
14. Worell James. Terminal sequences for accessible endofunctors. Electronic Notes in Theoretical Computer Science. 19:1999