Full Abstraction for HOPLA

Forfattere

  • Mikkel Nygaard
  • Glynn Winskel

DOI:

https://doi.org/10.7146/brics.v10i42.21814

Resumé

A fully abstract denotational semantics for the higher-order process language HOPLA is presented. It characterises contextual and logical equivalence, the latter linking up with simulation. The semantics is a clean, domain-theoretic description of processes as downwards-closed sets of computation paths: the operations of HOPLA arise as syntactic encodings of canonical constructions on such sets; full abstraction is a direct consequence of expressiveness with respect to computation paths; and simple proofs of soundness and adequacy shows correspondence between the denotational and operational semantics.

Downloads

Publiceret

2003-12-11

Citation/Eksport

Nygaard, M., & Winskel, G. (2003). Full Abstraction for HOPLA. BRICS Report Series, 10(42). https://doi.org/10.7146/brics.v10i42.21814

Nummer

Nr. 42 (2003): RS-42 Full Abstraction for HOPLA

Sektion

Artikler

Licens

Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

    1. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  1. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).