Logical Full Abstraction and PCF

dc.contributor.author	Longley, John R
dc.contributor.author	Plotkin, Gordon
dc.coverage.spatial	20	en
dc.date.accessioned	2003-11-06T10:24:49Z
dc.date.available	2003-11-06T10:24:49Z
dc.date.issued	2000
dc.identifier.uri	http://hdl.handle.net/1842/218
dc.description.abstract	We 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.extent	227592 bytes
dc.format.mimetype	application/pdf
dc.language.iso	en
dc.subject	Laboratory for Foundations of Computer Science
dc.title	Logical Full Abstraction and PCF	en
dc.type	Preprint	en