Games and Full Abstraction for PCF: Joint Announcement

• To: linear@edu.stanford.cs
• Subject: Games and Full Abstraction for PCF: Joint Announcement
• From: Luke Ong <Luke.Ong@uk.ac.cambridge.computer-lab>
• Date: Tue, 27 Jul 93 16:45:24 +0100
• Approved: types@dcs.gla.ac.uk

    Games and Full Abstraction for PCF: Joint Announcement

Say that a model for PCF is *intensionally fully abstract* if it
is algebraic, and all its compact elements are definable. No 
previously known models of PCF defined independently of the 
syntax of PCF have had this property.

Intensionally fully abstract models of PCF have now been found,
independently, by two groups: Abramsky, Jagadeesan and Malacaria;
and Hyland and Ong. Although the presentations are quite different,
its seems that the models are very close.

Documents giving some further details of the two approaches can
be obtained by anonymous ftp from theory.doc.ic.ac.uk in

papers/Abramsky/gfapcf.dvi
papers/Ong/dgis.ps

• Prev: Referees Wanted
• Next: Brief Guide to LL
• Index(es):
  • Main
  • Thread