Abstract
This paper aims at substantiating a recently introduced categorical theory of ‘well-behaved’ operational semantics. A variety of concrete examples of structural operational rules is modelled categorically illustrating the versatility and modularity of the theory. Further, a novel functorial notion of guardedness is introduced which allows for a general and formal treatment of guarded recursive programs.
Research supported by EuroFOCS and the European Union TMR programme.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
P. Aczel. Non-well-founded sets. Number 14 in Lecture Notes. CSLI, 1988.
M.A. Arbib and E.G. Manes. Arrows, Structures, and Functors. Academic Press, 1975.
J.W. de Bakker and J.-J.Ch. Meyer. Metric semantics for concurrency. BIT, 28:504–529, 1988.
M. Barr. Terminal coalgebras in well-founded set theory. Theoretical Computer Science, 144(2):299–315, 1993.
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.
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 IV, pages 80–149. Prentice Hall, 1978.
M.C.B. Hennessy and G.D. Plotkin. 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.
P.T. Johnstone. Adjoint lifting theorems for categories of algebras. Bull. London Math. Soc., 7:294–297, 1975.
A. Kock. Strong functors and monoidal monads. Arch. Math. (Basel), 23:113–120, 1972.
R. Milner. A Calculus of Communicating Systems, volume 92 of LNCS. Springer Verlag, 1980.
R. Milner. Functions as processes. In M.S. Paterson, editor, Proc. of 17th ICALP, 1990.
E. Moggi. Notions of computation and monads. Information and Computation, 93:55–92, 1991.
G.D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981.
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.
M. Smyth and G. Plotkin. The category-theoretic solution of recursive domain equations. SIAM J. Comput., 11:761–783, 1982.
D. Turi. Functorial Operational Semantics and its Denotational Dual. PhD thesis, Free University, Amsterdam, June 1996. Accessible from <http://www.dcs.ed.ac.uk/home/dt/>.
D. Turi and G.D. Plotkin. Towards a mathematical operational semantics. In Proc. 12th LICS Conf. IEEE, Computer Society Press, 1997.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Turi, D. (1997). Categorical modelling of structural operational rules case studies. In: Moggi, E., Rosolini, G. (eds) Category Theory and Computer Science. CTCS 1997. Lecture Notes in Computer Science, vol 1290. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0026985
Download citation
DOI: https://doi.org/10.1007/BFb0026985
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63455-3
Online ISBN: 978-3-540-69552-3
eBook Packages: Springer Book Archive