4 citations found. Retrieving documents...
P. W. O'Hearn and J. G. Riecke. Fully abstract translations and parametric polymorphism. In Programming Languages and Systems -- ESOP '94, Lecture Notes in Computer Science 788, pages 454--468. Springer-Verlag, 1994.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Parametricity as a Notion of Uniformity in Reflexive Graphs - Dunphy (2002)   Self-citation (O'hearn)   (Correct)

....queues (called a concrete implementation) along with implementations for the basic operations. Various good semantic models for parametrically polymorphic languages have been produced using families of functions which seem uniform to interpret parametrically polymorphic functions [JT93, OR94, OT95] An abstract characterization of uniform families applicable to a wide range of settings beyond that of sets and functions would be useful in producing semantic models for more polymorphic langauages. A characterization of uniform families can be used to characterize the information ....

P. W. O'Hearn and J. G. Riecke. Fully abstract translations and parametric polymorphism. In Programming Languages and Systems - ESOP '94, volume 788 of LNCS. Springer-Verlag, 1994. 262


Kripke Logical Relations and PCF - O'Hearn, Riecke (1995)   (6 citations)  Self-citation (O'hearn Riecke)   (Correct)

....1992) and we make no claim of great originality. It is clearly interesting, however, that such a full abstraction result is possible using logical relations. We were led to the connection between the two works by our own work on translating PCF into a language with parametric polymorphism (O Hearn and Riecke, 1994) (hence the connection to definability and Jung and Tiuryn s work) We view our results as strengthening, and providing further justification for, the research program begun in (Sieber, 1992) One crucial question remains: is the model based on Kripke relations actually different than Sieber s ....

O'Hearn, P. and Riecke, J. (1994). Fully abstract translations and parametric polymorphism. In Sannella, D., editor, Programming Languages and Systems---ESOP '94, volume 788 of Lecture Notes in Computer Science, pages 454--468. Springer-Verlag.


Appears in LISP and Symbolic Computation 9(1):77--107.. - Ian Stark University   (Correct)

No context found.

P. W. O'Hearn and J. G. Riecke. Fully abstract translations and parametric polymorphism. In Programming Languages and Systems -- ESOP '94, Lecture Notes in Computer Science 788, pages 454--468. Springer-Verlag, 1994.


Names and Higher-Order Functions - Stark (1995)   (29 citations)  (Correct)

No context found.

P. W. O'Hearn and J. G. Riecke. Fully abstract translations and parametric polymorphism. In Programming Languages and Systems --- ESOP '94, Lecture Notes in Computer Science 788, pages 454--468. Springer-Verlag, 1994. (pp. 123, 125)

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