Complete trace models of state and control

01/21/2021
by   Guilhem Jaber, et al.
0

We consider a hierarchy of four typed call-by-value languages with either higher-order or ground-type references and with either callcc or no control operator.Our first result is a fully abstract trace model for the most expressive setting, featuring both higher-order references and callcc, 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 callcc. 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/24/2022

Towards a Higher-Order Mathematical Operational Semantics

Compositionality proofs in higher-order languages are notoriously involv...
research
02/16/2023

Weak Similarity in Higher-Order Mathematical Operational Semantics

Higher-order abstract GSOS is a recent extension of Turi and Plotkin's f...
research
08/05/2023

A denotationally-based program logic for higher-order store

Separation logic is used to reason locally about stateful programs. Stat...
research
08/02/2023

Staged Specifications for Automated Verification of Higher-Order Imperative Programs

Higher-order functions and imperative references are language features s...
research
05/05/2021

Recursion and Sequentiality in Categories of Sheaves

We present a fully abstract model of a call-by-value language with highe...
research
06/23/2023

Extended Addressing Machines, explicit substitutions, PCF, definability, full abstraction

Extended addressing machines (EAMs) have been introduced to represent hi...
research
01/20/2020

Modular coinduction up-to for higher-order languages via first-order transition systems

The bisimulation proof method can be enhanced by employing `bisimulation...

Please sign up or login with your details

Forgot password? Click here to reset