Show simple item record

dc.contributor.authorHENNESSY, MATTHEW
dc.date.accessioned2008-11-24T11:17:07Z
dc.date.available2008-11-24T11:17:07Z
dc.date.created19-23 June 1993en
dc.date.issued1993
dc.date.submitted1993en
dc.identifier.citationM. Hennessy `A fully abstract denotational model for higher-order processes? in proceedings of the Eighth Annual IEEE Symposium on Logic in Computer Science, Montreal, Canada, 19-23 June 1993, IEEE Computer Society Press, 1993, pp 397-408en
dc.identifier.issn51009
dc.identifier.otherY
dc.identifier.urihttp://hdl.handle.net/2262/24944
dc.descriptionPUBLISHEDen
dc.description.abstractA higher-order process calculus is defined in which one can describe processes which transmit as messages other processes; it may be viewed as a generalization of the lazy ?-calculus. The authors present a denotational model for the language, obtained by generalizing the domain equation for S. Abramsky's (1990) model of the lazy ?-calculus. It is shown to be fully abstract with respect to three different behavioural preorders. The first is based on observing the ability of processes to perform an action in all contexts, the second on testing, and the final one on satisfying certain kinds of modal formulaeen
dc.format.extent397-408en
dc.format.extent935575 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoenen
dc.publisherIEEE Computer Society Pressen
dc.rightsYen
dc.subjectAdministrative Staff Authorsen
dc.titleA fully abstract denotational model for higher-order processesen
dc.typeConference Paperen
dc.type.supercollectionscholarly_publicationsen
dc.type.supercollectionrefereed_publicationsen
dc.identifier.peoplefinderurlhttp://people.tcd.ie/mcbhenne
dc.identifier.rssurihttp://ieeexplore.ieee.org/iel2/899/7167/00287568.pdf?tp=&isnumber=&arnumber=287568


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record