Games and Full Abstraction for PCF : Preliminary

@inproceedings{Abramsky1993GamesAF,
  title={Games and Full Abstraction for PCF : Preliminary},
  author={AnnouncementSamson Abramsky and R. Jagadeesan and Pasquale MalacariaJuly},
  year={1993}
}
  • AnnouncementSamson Abramsky, R. Jagadeesan, Pasquale MalacariaJuly
  • Published 1993
is one of the longest-standing problems in the semantics of programming languages. There is quite widespread agreement that it is one of the most diicult; there is much less agreement as to what exactly the problem is, or more particularly as to the precise criteria for a solution. The usual formulation is that one wants a \semantic characterization" of the fully abstract model (by which we mean the inequationally fully abstract order-extensional model, which Milner proved to be uniquely… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Full Abstraction for Sequential Languages: the State of the Art

G. Berry, P.-L. Curien, J.-J. Levy
Algebraic Methods in Semantics, • 1985
View 12 Excerpts
Highly Influenced

Fully Abstract Models of Typed lambda-Calculi

Theor. Comput. Sci. • 1977
View 13 Excerpts
Highly Influenced

Lcf considered as a programming language

View 13 Excerpts
Highly Influenced

Observable sequential algorithms on concrete data

P.-L. Curien
LICS • 1992
View 1 Excerpt

Full Abstraction and Semantic Equivalence

K. Mulmuley
1987
View 3 Excerpts

completement adequats et stable de lambda-calculs types

G. Berry, Modeles
These de Doctorat d'Etat, Universite Paris VII, • 1979
View 1 Excerpt

Similar Papers

Loading similar papers…