Categorical modelling of structural operational rules case studies

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1290, Issue , 1997, Pages 127-146

  Turi, Daniele ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CASE-STUDIES; OPERATIONAL SEMANTICS; RECURSIVE PROGRAMS;

SEMANTICS;

EID: 0004083276     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0026985     Document Type: Conference Paper

References (17)

1. P. Aczel. Non-well-founded sets. Number 14 in Lecture Notes. CSLI, 1988.
2. M.A. Arbib and E.G. Manes. Arrows, Structures, and Functors. Academic Press, 1975.
3. J.W. de Bakker and J.-J.Ch. Meyer. Metric semantics for concurrency. BIT, 28:504-529, 1988.
4. M. Barr. Terminal coalgebras in well-founded set theory. Theoretical Computer Science, 144(2):299-315, 1993.
5. B. Bloom, S. Istrail, and A.R. Meyer. Bisimulation can't be traced. Journal of the ACM, 42(1):232-268, jan 1995. A preliminary report appeared in Proc. 3rd LICS, pages 229-239, 1988.
6. J.A. Goguen, J.W. Thatcher, and E.G. Wagner. An initial algebra approach to the specification, correctness and implementation of abstract data types. In R.T. Yeh, editor, Current Trends in Programming Methodology, volume 4, pages 80-149. Prentice Hall, 1978.
7. M.C.B. Hennessy and G.D. Ptotkin. Full abstraction for a simple parallel programming language. In J. Bečvář, editor, Proc. 8th MFCS, volume 74 of LNCS, pages 108-120. Springer-Verlag, 1979.
8. P.T. Johnstone. Adjoint lifting theorems for categories of algebras. Bull. London Math. Soc., 7:294-297, 1975.
9. A. Kock. Strong functors and monoidal monads. Arch. Math. (Basel), 23:113-120, 1972.
10. R. Milner. A Calculus of Communicating Systems, volume 92 of LNCS. Springer-Verlag, 1980.
11. R. Milner. Functions as processes. In M.S. Paterson, editor, Proc. Of 17th ICALP, 1990.
12. E. Moggi. Notions of computation and monads. Information and Computation, 93:55-92, 1991.
13. G.D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981.
14. J. Rutten and D. Turi. On the foundations of final semantics: non-standard sets, metric spaces, partial orders. In J. de Bakker et al., editors, Proc. of the REX workshop Semantics - Foundations and Applications, volume 666 of LNCS, pages 477-530. Springer-Verlag, 1993.
15. M. Smyth and G. Plotkin. The category-theoretic solution of recursive domain equations. SIAM J. Gomput., 11:761-783, 1982.
16. D. Turi. Functorial Operational Semantics and its Denotational Dual. PhD thesis, Free University, Amsterdam, June 1996. Accessible from .
17. D. Turi and G.D. Plotkin. Towards a mathematical operational semantics. In Proc. 12th LICS Conf. IEEE, Computer Society Press, 1997.