Foundations of modular SOS(Extended Abstract)

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

Volumn 1672, Issue , 1999, Pages 70-80

  Mosses, Peter D ^a,b  

^a AALBORG UNIVERSITY   (Denmark)

^b STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FOUNDATIONS;

COMPOSABLE; EXTENDED ABSTRACTS; LABELLED TRANSITION SYSTEMS; MONAD TRANSFORMERS; TRANSITION SYSTEM;

SYSTEMS ENGINEERING;

EID: 84949231907     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48340-3_7     Document Type: Conference Paper

References (29)

1. E. Astesiano. Inductive and operational semantics. In E. J. Neuhold and M. Paul, editors, Formal Description of Programming Concepts, IFIP State-of-the-Art Report, pages 51-136. Springer-Verlag, 1991.
2. K. L. Bernstein. A congruence theorem for structured operational semantics of higher-order languages. In Proc. LICS'98, pages 153-163. IEEE, 1998.
3. D. Berry, R. Milner, and D. N. Turner. A semantics for ML concurrency primitives. In Proc. 17th Annual ACM Symposium on Principles of Proqramminq Lanquaqes, pages 119-129. ACM, 1992.
4. R. Cartwright and M. Felleisen. Extensible denotational language specifications. In M. Hagiya and J. C. Mitchell, editors, Symposium on Theoretical Aspects of Computer Software, number 789 in LNCS, pages 244-272, Sendai, Japan, Apr. 1994. Springer-Verlag.
5. P. Degano and C. Priami. Enhanced operational semantics. ACM Computing Surveys, 28(2):352-354, June 1996.
6. M. Felleisen and D. P. Friedman. Control operators, the SECD machine, and the λ-calculus. In Formal Description of Programming Concepts III, Proc. IFIP TC2 Working Conference, Gl. Avemaes, 1986, pages 193-217. North-Holland, 1987.
7. W. Fokkink and R. van Glabbeek. Ntyft/ntyxt rules reduce to ntree rules. Information and Computation, 126(1):1-10, 1996.
8. W. J. Fokkink and C. Verhoef. A conservative look at operational semantics with variable binding. Information and Computation, 146(l):24-54, 1998.
9. F. Gadducci and U. Montanari. The tile model. In Proof, Language, and Interaction. The MIT Press, 1999. To appear.
10. M. Hennessy. The Semantics of Programming Languages: An Elementary Introduction Using Structural Operational Semantics. Wiley, New York, 1990.
11. G. Kahn. Natural semantics. In STACS'87, Proc. Symp. on Theoretical Aspects of Computer Science, volume 247 of LNCS, pages 22-39. Springer-Verlag, 1987.
12. R. Milner. Operational and algebraic semantics of concurrent processes. In J. van Leeuwen, A. Meyer, M. Nivat, M. Paterson, and D. Perrin, editors, Handbook of Theoretical Computer Science, volume B, chapter 19. Elsevier Science Publishers, Amsterdam; and MIT Press, 1990.
13. R. Milner, M. Tofte, R. Harper, and D. MacQueen. The Definition of Standard ML (Revised). The MIT Press, 1997.
14. P. D. Mosses. Action semantics. Home page: http://www.brics.dk/Projects/AS/.
15. P. D. Mosses. Action Semantics. Number 26 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1992.
16. P. D. Mosses. Theory and practice of action semantics. In MFCS '96, Proc. 21st Int. Symp. on Mathematical Foundations of Computer Science (Cracow, Poland, Sept. 1996), volume 1113 of LNCS, pages 37-61. Springer-Verlag, 1996.
17. P. D. Mosses. Semantics, modularity, and rewriting logic. In C. Kirchner and H. Kirchner, editors, WRLA '98, Proc. 2nd Int. Workshop on Rewriting Logic and its Applications, Pont-à-Mousson, France, volume 15 of Electronic Notes in Theoretical Computer Science, 1998. http://www.elsevier.nl/locate/entcs/volumel5.html.
18. P. D. Mosses. Foundations of modular SOS. BRICS Report Series, BRICS, Dept, of Computer Science, Univ. of Aarhus, 1999.
19. P. D. Mosses. A modular SOS for action notation (extended abstract). In P. D. Mosses, editor, Proc. 2nd Int. Workshop on Action Semantics, Amsterdam, 1999, BRICS Notes Series. BRICS, Dept, of Computer Science, Univ. of Aarhus, 1999.
20. P. D. Mosses. A modular SOS for ML concurrency primitives. Draft, available from http://www.brics.dk/ pdm/, Apr. 1999.
21. H. R. Nielson and F. Nielson. Semantics with Applications: A Formal Introduction. Wiley, Chichester, UK, 1992.
22. G. D. Plotkin. A structural approach to operational semantics. Lecture Notes DAIMI FN-19, Dept, of Computer Science, Univ. of Aarhus, 1981.
23. G. D. Plotkin. An operational semantics for CSP. In D. Bjørner, editor, Formal Description of Programming Concepts II, Proc. IFIP TC2 Working Conference, Garmisch-Partenkirchen, 1982. IFIP, North-Holland, 1983.
24. C. Priami. Enhanced Operational Semantics for Concurrency. PhD thesis, Dipar- timento di Informatica, Università degli Studi di Pisa, 1996.
25. J. H. Reppy. CML: A higher-order concurrent language. In Proc. SIGPLAN'91, Conf. on Prog. Lang. Design and Impl., pages 293-305. ACM, 1991.
26. J. H. Reppy. Higher-Order Concurrency. PhD thesis, Computer Science Dept., Cornell Univ., 1992. Tech. Rep. TR 92-1285.
27. K. Slonneger and B. L. Kurtz. Formal Syntax and Semantics of Programming Languages: A Laboratory Based Approach. Addison-Wesley, 1995.
28. D. Turi and G. D. Plotkin. Towards a mathematical operational semantics. In Proc. LICS'97, pages 280-291. IEEE, 1997.
29. A. Wright and M. Felleisen. A syntactic approach to type soundness. Technical Report TR91-160, Dept, of Computer Science, Rice University, 1991.