• A fully abstract denotational model for higher-order processes

    Thumbnail Image

    Files

    00287568.pdf (913.65 KB)

    Date

    1993

    Authors

    Journal Title

    Journal ISSN

    Volume Title

    Publisher

    IEEE Computer Society Press

    Access

    Embargo end date

    Citation

    M. 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-408

    Abstract

    A 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 formulae

    Description

    PUBLISHED

    URI

    http://hdl.handle.net/2262/24944

    Collections

    Administrative Staff Authors (Scholarly Publications)

    Endorsement

    Review

    Supplemented By

    Referenced By

    Keywords

    Administrative Staff Authors
    Author's Homepage: http://people.tcd.ie/mcbhenne

    Author: HENNESSY, MATTHEW

    Publisher: IEEE Computer Society Press
    Type of material: Conference Paper