Full Abstraction for HOPLA

traction for HOPLA Mikkel Nygaard1 and Glynn Winskel2 1 BRICS , University of Aarhus 2 Computer Laboratory, University of Cambridge 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 s 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.

• Type: Conference
• Year: 2003
• Where: CONCUR
• Authors: Mikkel Nygaard, Glynn Winskel
• Keywords: Abstract Denotational Semantics, CONCUR 2003, HOPLA, Process Language Hopla