A structural approach to operational semantics

[1]  James E. Donahue,et al.  Locations considered unnecessary , 1977, Acta Informatica.

[2]  C. A. R. Hoare,et al.  Consistent and complementary formal theories of the semantics of programming languages , 1974, Acta Informatica.

[3]  M. Felleisen,et al.  on the Principles of Programming Languages , 1997 .

[4]  Robert S. Boyer,et al.  Computational Logic , 1990, ESPRIT Basic Research Series.

[5]  Harold T. Hodes,et al.  The | lambda-Calculus. , 1988 .

[6]  William B. Ackerman,et al.  Data Flow Languages , 1899, Computer.

[7]  Joseph E. Stoy,et al.  Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory , 1981 .

[8]  Michael Marcotty,et al.  The programming language landscape , 1981 .

[9]  M. Howard Williams,et al.  Methods for Specifying Static Semantics , 1981, Comput. Lang..

[10]  W. Li,et al.  A First Attempt at Translating CSP into CCS , 1981, ICDCS.

[11]  Ole Lehrmann Madsen,et al.  On defining semantics by means of extended attribute grammars , 1980, Semantics-Directed Compiler Generation.

[12]  Wilfried Brauer,et al.  Net Theory and Applications , 1980, Lecture Notes in Computer Science.

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

[14]  Jean-Jacques Lévy,et al.  A Survey of Some Syntactic Results in the lambda-Calculus , 1979, MFCS.

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

[16]  Michael J. C. Gordon,et al.  The Denotational Description of Programming Languages , 1979, Springer New York.

[17]  John C. Reynolds,et al.  Syntactic control of interference , 1978, POPL.

[18]  G.D. Plotkin,et al.  LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..

[19]  B. J. Mailloux,et al.  Revised Report on the Algorithmic Language ALGOL 68 , 1976, SIGP.

[20]  J. C. Cleaveland,et al.  Grammars for programming languages , 1977 .

[21]  Robert M. Keller,et al.  Formal verification of parallel programs , 1976, CACM.

[22]  Gregor von Bochmann,et al.  A Sampler of Formal Definitions , 1976, CSUR.

[23]  Richard S. Bird,et al.  Programs and Machines , 1976 .

[24]  Robin Milner.  Program Semantics and mechanized proof , 1976 .

[25]  James J. Horning,et al.  What the Compiler Should Tell the User , 1976, Compiler Construction.

[26]  Christopher Strachey,et al.  A theory of programming language semantics , 1976 .

[27]  Gordon D. Plotkin,et al.  Call-by-Name, Call-by-Value and the lambda-Calculus , 1975, Theor. Comput. Sci..

[28]  Rasmus Lerdorf,et al.  Introduction to combinatory logic , 1972 .

[29]  Christopher Strachey,et al.  The varieties of programming language , 1972 .

[30]  Henry F. Ledgard.  Ten Mini-Languages: A Study of Topical Issues in Programming Languages , 1971, CSUR.

[31]  D. Prawitz.  Ideas and Results in Proof Theory , 1971 .

[32]  H. Barendregt.  Some extensional term models for combinatory logics and lambda - calculi , 1971 .

[33]  Peter E. Lauer,et al.  Consistent formal theories of the semantics of programming languages , 1971 .

[34]  Rod M. Burstall,et al.  Proving Properties of Programs by Structural Induction , 1969, Comput. J..

[35]  Max J. Cresswell,et al.  A New Introduction to Modal Logic , 1998 .

[36]  P. J. Landin,et al.  Correspondence between ALGOL 60 and Church's Lambda-notation , 1965, Commun. ACM.

[37]  P. J. Landin.  The Mechanical Evaluation of Expressions , 1964, Comput. J..