Show simple item record

dc.contributor.authorPlotkin, Gordon
dc.coverage.spatial21en
dc.date.accessioned2003-11-06T10:30:45Z
dc.date.available2003-11-06T10:30:45Z
dc.date.issued2003-11-06T10:30:45Z
dc.identifier.urihttp://hdl.handle.net/1842/219
dc.description.abstractInspired by a question of Riecke, we consider the interaction of totality and full abstraction, asking whether full abstraction holds for Scott’s model of cpos and continuous functions if one restricts to total programs and total observations. The answer is negative, as there are distinct operational and denotational notions of totality. However, when two terms are each total in both senses then they are totally equivalent operationally i they are totally equivalent in the Scott model. Analysing further, we consider sequential and parallel versions of PCF and several models: Scott’s model of continuous functions, Milner’s fully abstract model of PCF and their e ective submodels. We investigate how totality di ers between these models. Some apparently rather di cult open problems arise, essentially concerning whether the sequential and parallel versions of PCF have the same expressive power, in the sense of total equivalence.en
dc.format.extent229657 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.subjectLaboratory for Foundations of Computer Science
dc.titleFull Abstraction, Totality and PCFen
dc.typePreprinten


Files in this item

This item appears in the following Collection(s)

Show simple item record