Complete trace models of state and control

by   Guilhem Jaber, et al.

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.



page 1

page 2

page 3

page 4


Resource Transition Systems and Full Abstraction for Linear Higher-Order Effectful Systems

We investigate program equivalence for linear higher-order(sequential) l...

Recursion and Sequentiality in Categories of Sheaves

We present a fully abstract model of a call-by-value language with highe...

Game Semantics: Easy as Pi

Game semantics has proven to be a robust method to give compositional se...

Revisiting Semantics of Interactions for Trace Validity Analysis

Interaction languages such as UML sequence diagrams are often associated...

A Domain Semantics for Higher-Order Recursive Processes

The polarized SILL programming language uniformly integrates functional ...

Symbolic Execution Game Semantics

We present a framework for symbolically executing and model checking hig...

On the Axiomatisability of Parallel Composition

This paper studies the existence of finite equational axiomatisations of...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.