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 …

We introduce type-checking games, which are ω-regular games over Böhm trees,
determined by a type of the Kobayashi-Ong intersection type system. These games are a …

We show how solutions to many recursive arena equations can be computed in a natural
way by allowing loops in arenas. We then equip arenas with winning functions and total …

This study aims to determine whether the scattergories game significantly enhances
Makassar junior high school students' vocabulary mastery. The researcher employed a pre …

Game semantics is a denotational semantics presenting compositionally the computational
behaviour of various kinds of effectful programs. One of its celebrated achievement is to …

Game Semantics is a powerful mathematical framework to reason compositionally on
programs. In contrast to other more classical methods in denotational semantics, game …

We present a new game semantics for Martin-Löf type theory (MLTT); our aim is to give a
mathematical and intensional explanation of MLTT. Specifically, we propose a category with …

We estimate the maximal length of interactions between strategies in HO/N game semantics,
in the spirit of the work by Schwichtenberg and Beckmann for the length of reduction in …

We describe a sequent calculus μLJ with primitives for inductive and coinductive datatypes
and equip it with reduction rules allowing a sound translation of Gödel's system T. We …

In this paper, we study the complexity of execution in higher-order programming languages.
Our study has two facets: on the one hand we give an upper bound to the length of …