Semantics of Computation

machines One way to give a language semantics is to implement it on a hypothetical specialised processor that directly manipulates language terms through stacks, registers and so forth. Examples include the SMC machine, the SECD machine, Krivine’s machine, the CAM, . . . These abstract machines are low level, with every step directly justified by semantic intuition. This is good for expressing techniques to interpret or compile high-level languages. They do not however capture the semantics itself, which makes them poor for reasoning about general properties of languages and programs.

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

[2]  Martín Abadi,et al.  A Theory of Objects , 1996, Monographs in Computer Science.

[3]  Abbas Edalat.  Domain theory in stochastic processes , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[4]  Jean-Yves Girard,et al.  Towards a geometry of interaction , 1989 .

[5]  Jon G. Riecke,et al.  Fully abstract translations between functional languages , 1991, POPL '91.

[6]  Samson Abramsky,et al.  A Domain Equation for Bisimulation , 1991, Inf. Comput..

[7]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[8]  Glynn Winskel,et al.  A Presheaf Semantics of Value-Passing Processes , 1996, CONCUR.

[9]  J. Girard,et al.  Advances in Linear Logic , 1995 .

[10]  K. Sieber.  Applications of Categories in Computer Science: Reasoning about sequential functions via logical relations , 1992 .

[11]  R. Milner.  Calculi for interaction , 1996, Acta Informatica.

[12]  Nancy A. Lynch,et al.  A Proof of the Kahn Principle for Input/Output Automata , 1989, Inf. Comput..

[13]  Andrew Donald Gordon,et al.  Functional programming and input/output , 1995 .

[14]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[15]  Peter W. O'Hearn,et al.  Kripke Logical Relations and PCF , 1995, Inf. Comput..

[16]  Matthias Felleisen,et al.  A call-by-need lambda calculus , 1995, POPL '95.

[17]  Andrew M. Pitts,et al.  Relational properties of recursively defined domains , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.