Full Abstraction for HOPLA
Keyword(s):
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.
Keyword(s):
Keyword(s):
1996 ◽
Vol 6
(5)
◽
pp. 409-453
◽
Keyword(s):
1998 ◽
Vol 8
(5)
◽
pp. 447-491
◽
Keyword(s):
2011 ◽
Vol 403-408
◽
pp. 4859-4866
◽
Keyword(s):
Keyword(s):
2002 ◽
pp. 434-448
◽