Correspondence between Operational and Denotational Semantics (1995)

by C. -h. L. Ong
Venue:Handbook of Logic in Computer Science
Citations:23 - 0 self

Documents Related by Co-Citation

395 LCF considered as a programming language – G Plotkin - 1977
192 Full Abstraction for PCF – Samson Abramsky, Radha Jagadeesan, Pasquale Malacaria - 1996
110 Fully abstract models of typed lambda calculi – R Milner - 1977
31 Kripke Logical Relations and PCF – Peter W. O'Hearn, Jon G. Riecke - 1995
267 Semantics of Programming Languages: Structures and Techniques. Foundations of Computing Series – C Gunter - 1992
59 Hereditarily Sequential Functionals – Hanno Nickau - 1994
200 On full abstraction for PCF – J M E Hyland, C H L Ong
62 Full Abstraction for Functional Languages with Control – James Laird - 1997
32 Reasoning about sequential functions via logical relations – K Sieber - 1992
58 Lambda-definability in the full type hierarchy – G Plotkin - 1980
29 Domains and Denotational Semantics: History, Accomplishments and Open Problems – Marcelo Fiore, Achim Jung, Eugenio Moggi, Peter O'Hearn, Jon Riecke, Giuseppe Rosolini, Ian Stark - 1996
1565 The Definition of Standard ML – Robin Milner, Mads Tofte - 1990
12 Sequential models of PCF: some contributions to the domain-theoretic approach to full abstraction – A Bucciarelli - 1993
210 Games and Full Completeness for Multiplicative Linear Logic – Samson Abramsky, Radha Jagadeesan - 1994
27 Full Abstraction and Semantic Equivalence – K Mulmuley - 1987
53 Full Abstraction for sequential languages: the state of the art – G Berry, P-L Curien, J-J Lévy - 1985
315 Functions as processes – R Milner - 1990
130 Lambda-Calculus Models of Programming Languages – J H Morris - 1968
3219 Communication and Concurrency – R Milner - 1990