The origins of structural operational semantics

Journal of Logic and Algebraic Programming

Volumn 60-61, Issue SUPPL., 2004, Pages 3-15

  Plotkin, Gordon D ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

(Labelled) transition systems; (Structural) operational semantics; Abstract machines; Big step semantics; Concurrency; Semantics of programming languages; Small step semantics; Static semantics; Structural induction; calculus

Indexed keywords

ABSTRACTING; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; INTERACTIVE COMPUTER GRAPHICS; SEMANTICS; TEACHING; TECHNICAL WRITING;

(LABELED) TRANSITION SYSTEMS; (STRUCTURAL) OPERATIONAL SEMANTICS; ABSTRACT MACHINES; BIG STEP SEMANTICS; CONCURRENCY; SEMANTICS OF PROGRAMING LANGUAGES; SMALL STEP SEMANTICS; STATIC SEMANTICS; STRUCTURAL INDUCTION; Λ-CALCULUS;

COMPUTER PROGRAMMING;

EID: 2942514538     PISSN: 15678326     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jlap.2004.03.009     Document Type: Article

References (72)

1. Apt K.R. Formal justification of a proof system for communicating sequential processes. JACM. 30(1):1983;197-216.
2. Apt K.R. Ten years of Hoare's logic: a survey, part II: nondeterminism. TCS. 28:1984;83-109.
3. Apt K.R., Olderog E.-R. Verification of Sequential and Concurrent Programs, Graduate Texts in Computer Science. second ed. 1997;Springer-Verlag, Berlin.
4. K.R. Apt, G.D. Plotkin, A cook's tour of countable nondeterminism, in: S. Even, O. Kariv (Eds.), Proc. 8th ICALP, LNCS, vol. 115, Springer-Verlag, Berlin, 1981, pp. 479-494.
5. Apt K.R., Plotkin G.D. Countable nondeterminism and random assignment. JACM. 33(4):1986;724-767.
6. C.D. Allen, D.N. Chapman, C.B. Jones, A formal definition of ALGOL 60, Technical Report 12.105, IBM Laboratory, Hursley, 1972.
7. Astesiano E., Costa G. Sharing in nondeterminism. Maurer H.A. Proc. 6th Coll. on Automata. LNCS. vol. 71:1979;1-15 Springer-Verlag, Berlin.
8. Astesiano E., Costa G. Nondeterminism and fully abstract models. Informatique Théorique et Applications. 14(4):1980;323-347.
9. I. Attali, S. Naturelle, Evaluation et Expressivité, Mémoire d'Habilitation à Diriger des Recherches, Université de Nice, Sophia Antipolis, 1996.
10. H. Barendregt, Some Extensional Term Models for Combinatory Logics and λ -Calculi, Ph.D. thesis, Department of Mathematics, Utrecht, 1971.
11. Bergstra J.A., Ponse A., Smolka S.A. Handbook of Process Algebra. 2001;Elsevier, Amsterdam.
12. Bjørner D., Jones C.B. The Vienna Development Method: The Meta-Language. LNCS. vol. 61:1978;Springer-Verlag, Berlin.
13. Bobrow D.G., Wegbreit B. A model for control structures for artificial intelligence programming languages. IEEE Transactions on Computers. 25(4):1976;347-353.
14. Burstall R.M. Proving properties of programs by structural induction. The Computer Journal. 12(1):1969;41-48.
15. J.-M. Cadiou, Recursive Definitions of Partial Functions and their Computations, Ph.D. thesis, Stanford University, 1972.
16. Despeyroux T. Executable specification of static semantics. Kahn G., MacQueen D.B., Plotkin G. Semantics of Data Types. LNCS. vol. 173:1984;215-233 Springer-Verlag, Berlin.
17. Donzeau-Gouge V., Huet G., Kahn G., Lang B. Programming environments based on structured editors: the MENTOR experience. Barstow D., Sandewall E., Shrobe H. Interactive Programming Environments. 1984;128-140 McGraw-Hill, New York.
18. Elgot C.C., Robinson A. Random-access stored program machines, an approach to programming languages. JACM. 11(4):1964;365-399.
19. Fischer M.J. Lambda-calculus schemata. Lisp and Symbolic Computation. 6(3 & 4):1993;259-288.
20. M.J.C. Gordon, Models of Pure LISP, Ph.D. thesis, Experimental Programming Reports: No. 31, School of Artificial Intelligence, University of Edinburgh, 1973.
21. M.J.C. Gordon, Operational reasoning and denotational semantics, Construction, Amélioration et Vérification de Programmes, Colloques IRIA, Arc et Senans, 1975, pp. 83-98.
22. Gordon M.J.C. The Denotational Description of Programming Languages. 1979;Springer-Verlag, Berlin.
23. Gordon M.J.C. Register transfer systems and their behaviour. Breuer M., Hartenstein R. Computer Hardware Description Languages and Their Applications. 1981;23-36 North Holland, Amsterdam.
24. W. Henhapl, C.B. Jones, On the interpretation of GOTO statements in the ULD, Technical Report LR 25.3.065, IBM Laboratory, Vienna, 1970.
25. Hennessy M.C.B. The semantics of call-by-value and call-by-name in a nondeterministic environment. SIAM Journal on Computing. 9(1):1980;67-84.
26. Hennessy M.C.B., Ashcroft E.A. A mathematical semantics for a nondeterministic typed lambda-calculus. TCS. 11(3):1980;225-227.
27. Hennessy M.C.B., Li W. Translating Ada tasking into CCS. Bjørner D. Proc. IFIP TC-2 Work. Conf. on Formal Description of Programming Concepts (II). 1982;227-247 North-Holland, Amsterdam.
28. Hennessy M.C.B., Li W., Plotkin G.D. A first attempt at translating CSP into CCS. Gelenbe E. Proc. 2nd Int. Conf. on Distributed Computing Systems. 1981;105-115 IEEE Computer Society Press, New York.
29. Hennessy M.C.B., Plotkin G.D. Full abstraction for a simple parallel programming language. Goos G., Hartmanis J. Proc. 8th MFCS, LNCS. vol. 74:1979;108-120 Springer-Verlag, Berlin.
30. Hennessy M.C.B., Plotkin G.D. A term model for CCS. Dembinski P. Proc. 9th MFCS, LNCS. vol. 88:1980;261-274 Springer-Verlag, Berlin.
31. Jones C.B. Scientific decisions which characterize VDM. Wing J.M., Woodcock J., Davies J. FM'99 - Formal Methods. LNCS. vol. 1708:1999;28-47 Springer-Verlag, Berlin.
32. Kahn G., MacQueen D. Coroutines and networks of parallel processes. Gilchrist B. Proc. IFIP'77. 1977;993-998 North-Holland, Amsterdam.
33. Keller R.M. Formal verification of parallel programs. CACM. 19(7):1976;371-384.
34. Landin P.J. The mechanical evaluation of expressions. The Computer Journal. 6(4):1964;308-320.
35. Landin P.J. A correspondence between ALGOL-60 and Church's Lambda Notation: Parts I and II. CACM. 8:1965;89-101. 158-165.
36. Landin P.J. The next 700 programming languages. CACM. 9(3):1966;157-166.
37. Landin P.J. A lambda calculus approach. Fox L. Advances in Programming and Non-Numerical Computation. 1966;97-141 Pergamon Press, Oxford. Chapter 5, Symposium Publications Division.
38. Ledgard H.F. Ten mini-languages: a study of topical issues in programming languages. ACM Computing Surveys. 3(3):1971;115-146.
39. Li W. An operational semantics of multitasking and exception handling in Ada. in: Proc. AdaTEC Conf. on Ada. 1982;ACM Press, New York. pp. 138-151.
40. W. Li, An Operational Approach to Semantics and Translation for Concurrent Programming Languages, Ph.D. thesis, Department of Computer Science, University of Edinburgh, CST-20-83, 1983.
41. Lucas P. Formal semantics of programming languages: VDL. IBM Journal of Research and Development. 25(5):1981;549-561.
42. Lucas P., Walk K. On the formal description of PL/I. Annual Review in Automatic Programming, Part 3. vol. 6:1969;105-182 Pergamon Press, Oxford. pp. 105-182.
43. Lynch N.A., Fischer M.J. On describing the behavior and implementation of distributed systems. TCS. 13(1):1981;17-43.
44. P. Martin-Löf, Constructive mathematics and computer programming, in: L.J. Cohen, et al. (Eds.), Proc. 6th International Congress for Logic, Method, and Philosophy of Science, Studies in Logic and the Foundations of Mathematics, vol. 104, Elsevier, North-Holland, Amsterdam, 1982, pp. 153-175.
45. McCarthy J. Towards a mathematical theory of computation. Popplewell C.M. Proc. IFIP Congress '62. 1963;21-28 North Holland, Amsterdam.
46. McCarthy J. A basis for a mathematical theory of computation. Braffort P., Hirschberg D. Computer Programming and Formal Systems. 1963;33-70 North-Holland, Amsterdam.
47. McCarthy J. A formal description of a subset of ALGOL. Steel T.B. Jr. Formal Language Description Languages for Computer Programming, Proc. IFIP Working Conf. 1966;1-12 North Holland, Amsterdam.
48. McCarthy J., Painter J.A. Correctness of a compiler for arithmetic expressions. Schwartz J.T. Mathematical Aspects of Computer Science. Proc. Symp. in Applied Mathematics. vol. 19:1967;33-41 American Mathematical Society, Providence, RI.
49. M. Millington, Theories of Translation Correctness for Concurrent Programming Languages, Ph.D. thesis, Department of Computer Science, University of Edinburgh, CST-46-87, 1987.
50. Milner R. Program semantics and mechanized proofs. Apt K.R., de Bakker J.W. Foundations of Computer Science II, Mathematical Centre Tracts, No. 82, Amsterdam. 1976.
51. Milner R. A Calculus of Communicating Systems. LNCS. vol. 93:1980;Springer-Verlag, Berlin.
52. Milne R., Strachey C. A Theory of Programming Language Semantics. 1976;Chapman & Hall, London.
53. F. Nielson, H. Riis, A Treatment of Goto and Jump, Aarhus, 1981, unpublished manuscript.
54. Plotkin G.D. Call-by-name, call-by-value and the lambda-calculus. TCS. 1(2):1975;125-159.
55. G.D. Plotkin, LCF Considered as a Programming Language, Construction, Amélioration et Vérification de Programmes, Colloques IRIA, Arc et Senans, 1975, pp. 243-261.
56. Plotkin G.D. LCF considered as a programming language. TCS. 5(3):1977;225-255.
57. Plotkin G.D. Dijkstra's predicate transformers and Smyth's power domains. Bjørner D. Abstract Software Specifications: 1979 Copenhagen Winter School Proceedings. LNCS. vol. 86:1980;527-553 Springer-Verlag, Berlin.
58. Plotkin G.D. An operational semantics for CSP. Salwicki A. Logics of Programs and their Applications. LNCS. vol. 148:1980;250-252 Springer-Verlag, Berlin.
59. G.D. Plotkin, A structural approach to operational semantics, DAIMI FN-19, Computer Science Department, Aarhus University, 1981.
60. Plotkin G.D. An operational semantics for Hoare's CSP. Bjørner D. Proc. IFIP TC-2 Work. Conf. on Formal Description of Programming Concepts (II). 1982;199-226 North-Holland, Amsterdam.
61. Reynolds J. Definitional interpreters for higher-order programming languages. in: Proc. 25th ACM National Conf. 1972;717-740 ACM, New York.
62. Sangiorgi D., Walker D. The. π -Calculus: A Theory of Mobile Processes:2001;Cambridge University Press, Cambridge.
63. D.S. Scott, Outline of a mathematical theory of computation, in: Proc. 4th Annual Princeton Conf. on Information Sciences and Systems, 1970, pp. 169-176.
64. D.S. Scott, Outline of a Mathematical Theory of Computation, Programming Research Group, Technical Monograph PRG-2, Oxford University, 1970.
65. Scott D.S. A type-theoretical alternative to ISWIM, CUCH, OWHY. TCS. 121(1 & 2):1993;411-440.
66. Smullyan R.M. Theory of formal systems. Annals of Mathematics Studies No. 47. 1961;Princeton University Press, Princeton.
67. Stoy J.E. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. 1977;MIT Press, Cambridge.
68. Tennent R.D. Principles of programming languages. Hoare C.A.R. Prentice Hall Series in Computer Science. 1981;Prentice Hall, London.
69. Turi D., Plotkin G.D. Towards a mathematical operational semantics. in: Proc. 12th LICS. 1997;280-291 IEEE Computer Society Press, Los Alamos.
70. Vuillemin J. Correct and optimal implementations of recursion in a simple programming language. JCSS. 9(3):1974;322-354.
71. C. Wadsworth, Semantics and Pragmatics of the Lambda Calculus, Ph.D. thesis, Oxford University, 1971.
72. ∞ -models of the λ -calculus SIAM Journal on Computing. 5(3):1976;488-522.