Quantum programming languages permit a hardware independent, high-level description of
quantum algo rithms. In particular, the quantum lambda-calculus is a higher-order …

The description of resources in game semantics has never achieved the simplicity and
precision of linear logic, because of the misleading conception that linear logic is more …

Quantum programming languages permit a hardware independent, high-level description of
quantum algorithms. In particular, the quantum λ-calculus is a higher-order language with …

Game semantics and session types are two formalisations of the same concept: message-
passing open programs following certain protocols. Game semantics represents protocols …

We define a new games model of Probabilistic PCF (PPCF) by enriching thin concurrent
games with symmetry, recently introduced by Castellan et al, with probability. This model …

We describe a framework for truly concurrent game semantics of programming languages,
based on Rideau and Winskel's concurrent games on event structures. The model supports …

Harmer and McCusker have developed a fully abstract game model for nondeterministic
Idealised Algol and, at the same time, revealed difficulties in constructing game models for …

Two families of denotational models have emerged from the semantic analysis of linear
logic: dynamic models, typically presented as game semantics, and static models, typically …

We build a cartesian closed category, called Cho, based on event structures. It allows an
interpretation of higher-order stateful concurrent programs that is refined and precise: on the …

This thesis studies problems of higher-order model-checking from a semantic and logical
perspective. Higher-order model-checking is concerned with the verification of properties …