Complete trace models of state and control - Inria - Institut national de recherche en sciences et technologies du numérique
Conference Papers Year : 2021

Complete trace models of state and control

Abstract

Abstract We consider a hierarchy of four typed call-by-value languages with either higher-order or ground-type references and with either $$\mathrm {call/cc}$$ call / cc or no control operator. Our first result is a fully abstract trace model for the most expressive setting, featuring both higher-order references and $$\mathrm {call/cc}$$ call / cc , constructed in the spirit of operational game semantics. Next we examine the impact of suppressing higher-order references and callcc in contexts and provide an operational explanation for the game-semantic conditions known as visibility and bracketing respectively. This allows us to refine the original model to provide fully abstract trace models of interaction with contexts that need not use higher-order references or $$\mathrm {call/cc}$$ call / cc . Along the way, we discuss the relationship between error- and termination-based contextual testing in each case, and relate the two to trace and complete trace equivalence respectively. Overall, the paper provides a systematic development of operational game semantics for all four cases, which represent the state-based face of the so-called semantic cube.

Dates and versions

hal-03510374 , version 1 (04-01-2022)

Identifiers

Cite

Guilhem Jaber, Andrzej S Murawski. Complete trace models of state and control. ESOP 2021 - 30th European Symposium on Programming, Mar 2021, Luxembourg, Luxembourg. pp.348-374, ⟨10.1007/978-3-030-72019-3_13⟩. ⟨hal-03510374⟩
40 View
0 Download

Altmetric

Share

More