A structural approach to operational semantics

Journal of Logic and Algebraic Programming

Volumn 60-61, Issue SUPPL., 2004, Pages 17-139

  Plotkin, Gordon D ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; CODES (SYMBOLS); COMMAND AND CONTROL SYSTEMS; COMPUTER HARDWARE; COMPUTER MONITORS; COMPUTER SYSTEMS; DATA STRUCTURES; ERROR CORRECTION; FORMAL LOGIC; PROGRAM DEBUGGING; REAL TIME SYSTEMS; SEMANTICS;

RUN-TIME ERRORS; SEMANTICS OF PROGRAMING LANGUAGES; SEMAPHORES;

COMPUTER PROGRAMMING LANGUAGES;

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

References (48)

1. [Bir] Bird, R. (1976) Programs and Machines, Wiley and Sons.
2. [Bra] Brauer, W., ed. (1980) Net Theory and Applications, LNCS 84, Springer.
3. [Gor] Gordon, M.J. (1979) The Denotational Description of Programming Languages, Springer.
4. [Gre] Greibach, S.A. (1975) Theory of Program Structures: Schemes, Semantics, Verification, LNCS 36, Springer.
5. [Kel] Keller, R.M. (1976) Formal Verification of Parallel Programs, Communications of the ACM 19(7):371-384.
6. [Lan] Landin, P.J. (1966) A Lambda-calculus Approach, Advances in Programming and Non-numerical Computation, ed. L. Fox, Chapter 5, pp. 97-154, Pergamon Press.
7. [Oll] Ollengren, A. (1976) Definition of Programming Languages by Interpreting Automata, Academic Press.
8. [Pet] Peterson, J.L. (1977) Petri Nets, ACM Computing Surveys 9(3):223-252.
9. [Sco] Scott, D.S. (1967) Some Definitional Suggestions for Automata Theory, Journal of Computer and System Sciences 1(2):187-212.
10. [Ten] Tennent, R.D. (1981) Principles of Programming Languages, Prentice-Hall.
11. [Weg] Wegner, P. (1972) The Vienna Definition Language, ACM Computing Surveys 4(1):5-63.
12. [Bar1] Barendregt, H. (1971) Some Extensional Term Models for Combinatary Logic and Lambda-calculi, PhD thesis, Department of Mathematics, Utrecht University.
13. [Bar2] Barendregt, H. (1981) The Lambda Calculus, Studies in Logic 103, North-Holland.
14. [Ber] Berry, G. and Lévy, J-J. A Survey of Some Syntactic Results in the Lambda-calculus, Proc. MFCS'79, ed. J. Becvár, LNCS 74, pp. 552-566.
15. [Boy] Boyer, R.S. and Moore, J.S. (1979) A Computational Logic, Academic Press.
16. [Bur] Burstall, R.M.B. (1969) Proving Properties of Programs by Structural Induction, Computer Journal 12(1)-41-48.
17. [Cle] Cleaveland, J.C. and Uzgalis, R.C. (1977) Grammars for Programming Languages, Elsevier.
18. [Hen1] Hennessy, M.C.B. and Plotkin, G.D. (1979) Full Abstraction for a Simple Parallel Programming Language, Proc. MFCS'79, ed. J. Becvár, LNCS 74, pp. 108-120.
19. [Hen2] Hennessy, M.C.B., Li, Wei and Plotkin, G.D. (1981) A First Attempt at Translating CSP into CCS, Proc. ICDCS'81, pp. 105-115, IEEE.
20. [Hin] Hindley, J.R., Lercher, B. and Seldin, J.P. (1972) Introduction to Combinatory Logic, Cambridge University Press.
21. [Hoa] Hoare, C.A.R. and Lauer, P.E. (1974) Consistent and Complementary Formal Theories of the Semantics of Programming Languages, Acta Informatica 3:135-153.
22. [Hor] Horning, J.J. (1974) What the Compiler Should Tell The User, Compiler Construction: An Advanced Course, eds F.L. Bauer and J. Eickel, LNCS 21, pp. 525-548.
23. [Lau] Lauer, P.E. (1971) Consistent Formal Theories of The Semantics of Programming Languages, PhD thesis, Queen's University of Belfast, IBM Laboratories Vienna TR 25.121.
24. [Led] Ledgard, H.F. (1971) Ten Mini-Languages: A Study of Topical Issues in Programming Languages, ACM Computing Surveys 3(3):115-146.
25. [Mad] Madsen, O.L. (1980) On Defining Semantics by Means of Extended Attribute Grammars, Semantics-Directed Compiler Generation, ed. N.D. Jones, LNCS 94, pp. 259-299.
26. [Mar] Marcotty, M., Ledgard, H.F. and von Bochmann, G. (1976) A Sampler of Formal Definitions, ACM Computing Surveys 8(2):191-276
27. [Mil1] Milner, A.J.R.G. (1976) Program Semantics and Mechanized Proof, Foundations of Computer Science II, eds K.R. Apt and J.W. de Bakker, Mathematical Centre Tracts 82, pp. 3-44.
28. [Mil2] Milner, A.J.R.G. (1980) A Calculus of Communicating Systems, LNCS 92.
29. [Plo1] Plotkin, G.D. (1975) Call-by-name, Call-by-value and the Lambda-calculus, Theoretical Computer Science 1(2):125-159.
30. [Plo2] Plotkin, G.D. (1977) LCF Considered as a Programming Language, Theoretical Computer Science 5(3):223-255.
31. [Sal] Salwicki, A. (1976) On Algorithmic Logic and its Applications, Mathematical Institute, Polish Academy of Sciences.
32. [Wij] van Wijngaarden, A., Mailloux, B.J., Peck, J.E.L., Koster, C.H.A., Sintzoff, M., Lindsey, C.H., Meertens, L.G.T. and Fisker, R.G. (1975) Revised Report on the Algorithmic Language ALGOL 68, Acta Informatica 5:1-236.
33. [Ack] Ackerman, W.B. (1982) Data Flow Languages, IEEE Computer 15(2):15-25.
34. [Don] Donahue, J.E. (1977) Locations Considered Unnecessary, Acta Informatica 8:221-242.
35. [Gor1] Gordon, M.J., Milner, A.J.R.G. and Wadsworth, C.P. (1979) Edinburgh LCF, LNCS 78, Springer.
36. [Gor2] Gordon, M.J. (1979) The Denotational Description of Programming Languages, Springer.
37. [Hin] Hindley, J.R., Lercher, B. and Seldin, J.P. (1972) Introduction to Combinatory Logic, Cambridge University Press.
38. [Hug] Hughes, G.E. and Cresswell, M.J. (1968) An Introduction to Modal Logic, Methuen.
39. [Lan1] Landin, P.J. (1964) The Mechanical Evaluation of Expressions, Computer Journal 6(4):308-320.
40. [Lan2] Landin, P.J. (1965) A Correspondence between ALGOL 60 and Church's Lambda-notation, Communications of the ACM 8(2):89-101 and 8(2):158-165.
41. [Lan2] Landin, P.J. (1965) A Correspondence between ALGOL 60 and Church's Lambda-notation, Communications of the ACM 8(2):89-101 and 8(2):158-165.
42. [Led] Ledgard, H.F. and Marcotty, M. (1981) The Programming Language Landscape, Science Research Associates.
43. [Mil] Milne, R.E. and Strachey, C. (1976) A Theory of Programming Language Semantics, Chapman and Hall.
44. [Pra] Prawitz, D. (1970) Ideas and Results in Proof Theory, Proc. 2nd Scandinavian Logic Symposium, ed. J.E. Fenstad, p. 237-309, North Holland.
45. [Rey] Reynolds, J.C. (1978) Syntactic Control of Interference, Proc. POPL'78, pp. 39-46.
46. [Str] Strachey, C. (1973) The Varieties of Programming Language, Technical Monograph PRG-10, Programming Research Group, Oxford University.
47. [Sto] Stoy, J.E. (1977) Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory, MIT Press.
48. [Wil] M.H. Williams (1981) Methods for Specifying Static Semantics, Computer Languages 6(1):1-17.