2000 character limit reached
A Concrete Representation of Observational Equivalence for PCF
Published 27 Feb 2010 in cs.LO | (1003.0107v1)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
