Categorical Modelling of Structural Operational Rules: Case Studies

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.

[1]  Jan J. M. M. Rutten,et al.  On the Foundation of Final Semantics: Non-Standard Sets, Metric Spaces, Partial Orders , 1992, REX Workshop.

[2]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[3]  Matthew Hennessy,et al.  Full Abstraction for a Simple Parallel Programming Language , 1979, MFCS.

[4]  Peter Aczel,et al.  Non-well-founded sets , 1988, CSLI lecture notes series.

[5]  John-Jules Ch. Meyer,et al.  Metric semantics for concurrency , 1988, BIT.

[6]  Robin Milner.  Functions as Processes , 1990, ICALP.

[7]  Gordon D. Plotkin,et al.  The category-theoretic solution of recursive domain equations , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[8]  M. Arbib,et al.  Arrows, Structures, and Functors: The Categorical Imperative , 1975 .

[9]  A. Kock.  Strong functors and monoidal monads , 1972 .

[10]  Eugenio Moggi,et al.  Notions of Computation and Monads , 1991, Inf. Comput..

[11]  P. T. Johnstone,et al.  Adjoint Lifting Theorems for Categories of Algebras , 1975 .

[12]  Gordon D. Plotkin,et al.  Towards a mathematical operational semantics , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[13]  Michael Barr,et al.  Terminal Coalgebras in Well-Founded Set Theory , 1993, Theor. Comput. Sci..

[14]  Albert R. Meyer,et al.  Bisimulation can't be traced , 1988, POPL '88.

[15]  D. Turi,et al.  Functional Operational Semantics and its Denotational Dual , 1996 .