Show simple item record

dc.contributor.authorLongley, John R
dc.contributor.authorPlotkin, Gordon
dc.coverage.spatial20en
dc.date.accessioned2003-11-06T10:24:49Z
dc.date.available2003-11-06T10:24:49Z
dc.date.issued2000
dc.identifier.urihttp://hdl.handle.net/1842/218
dc.description.abstractWe introduce the concept of logical full abstraction, generalising the usual equational notion. We consider the language PCF and two extensions with “parallel” operations. The main result is that, for standard interpretations, logical full abstraction is equivalent to equational full abstraction together with universality; the proof involves constructing enumeration operators. We also consider restrictions on logical complexity and on the level of types.en
dc.format.extent227592 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.subjectLaboratory for Foundations of Computer Science
dc.titleLogical Full Abstraction and PCFen
dc.typePreprinten


Files in this item

This item appears in the following Collection(s)

Show simple item record