S. Abramsky, R. Jagadeesan, P. Malacaria, Games and Full Abstraction for PCF, Parts I, II. Research Announcements (July, Sept. 1993), Imperial College, London. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Linear Läuchli Semantics - Blute, Scott (Correct)
....operational or syntactic behaviour of program terms using a more mathematical model. Indeed, the fundamental full completeness results of Abramsky and Jagadeesan [2] for multiplicative linear logic ( MLL) using game semantics recently led to a solution of the full abstraction problem for PCF [3], a fundamental problem in denotational semantics for many years [34] Finally, from a categorical viewpoint, full completeness theorems are asking for a full representation of a certain kind of free category, say C, into a model category E . In this sense, a full completeness theorem is a strong ....
S. Abramsky, R. Jagadeesan, P. Malacaria, Games and Full Abstraction for PCF, Parts I, II. Research Announcements (July, Sept. 1993), Imperial College, London.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC