TY - JOUR AU - Nygaard, Mikkel AU - Winskel, Glynn PY - 2003/12/11 Y2 - 2024/03/29 TI - Full Abstraction for HOPLA JF - BRICS Report Series JA - BRICS VL - 10 IS - 42 SE - Articles DO - 10.7146/brics.v10i42.21814 UR - https://tidsskrift.dk/brics/article/view/21814 SP - AB - 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. ER -