Computer Science – Logic in Computer Science
Scientific paper
2010-02-27
Computer Science
Logic in Computer Science
A result on observational equivalence for PCF and innocent strategies, as presented at the Games for Logic and Programming Lan
Scientific paper
The full abstraction result for PCF using game semantics requires one to identify all innocent strategies that are innocently indistinguishable. This involves a quantification over all innocent tests, cf. quantification over all innocent contexts. Here we present a representation of innocent strategies that equates innocently indistinguishable ones, yielding a representation of PCF terms that equates precisely those terms that are observational equivalent.
Churchill Martin
Laird James
McCusker Guy
No associations
LandOfFree
A Concrete Representation of Observational Equivalence for PCF does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Concrete Representation of Observational Equivalence for PCF, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Concrete Representation of Observational Equivalence for PCF will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-629637