The far side of the cube

08/10/2019
by   Dan R. Ghica, et al.
0

Game-semantic models usually start from the core model of the prototypical language PCF, which is characterised by a range of combinatorial constraints on the shape of plays. Relaxing each such constraint usually corresponds to the introduction of a new language operation, a feature of game semantics commonly known as the `Abramsky Cube'. In this presentation we relax all such combinatorial constraints, resulting in the most general game model, in which all the other game models live. This is perhaps the simplest set up in which to understand game semantics, so it should serve as a portal to the other, more complex, game models in the literature. It might also be interesting in its own right, as an extremal instance of the game-semantic paradigm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/11/2021

First-Order Problem Solving through Neural MCTS based Reinforcement Learning

The formal semantics of an interpreted first-order logic (FOL) statement...
research
01/13/2020

Nmbr9 as a Constraint Programming Challenge

Modern board games are a rich source of interesting and new challenges f...
research
03/24/2022

Game semantics of universes

This work extends the present author's computational game semantics of M...
research
11/29/2017

What's in a game? A theory of game models

Game semantics is a rich and successful class of denotational models for...
research
08/07/2017

On the Learnability of Programming Language Semantics

Game semantics is a powerful method of semantic analysis for programming...
research
05/02/2021

What Way Is It Meant To Be Played?

The most commonly used interface between a video game and the human user...
research
08/22/2018

Cookie Clicker

Cookie Clicker is a popular online incremental game where the goal of th...

Please sign up or login with your details

Forgot password? Click here to reset