Work

Template games, simple games, and Day convolution

Year: 2018

Type: preprint

Abstract: Game semantics has provided adequate models for a variety of programming languages, in which types are interpreted as two-player games and programs as strategies. Melliès (2018) suggested that such categories of games and strategies may be obtained as instances of a simple abstract construction on weak double categories. However, in the particular case of simple games, his construction slightly differs from the standard category. We refine the abstract construction using factorisation systems, and show that the new construction yields the standard category of simple games and strategies. Another perhaps surprising instance is Day's convolution monoidal structure on the category of presheaves over a strict monoidal category.

Source: HAL

Authors: Eberhart, Clovis, Hirschowitz, Tom, Laouar, Alexis

Institutions: National Institute of Informatics, Laboratoire de Mathématiques Blaise Pascal

Language: English

Topic: Logic, programming, and type systems

Subfield: Software

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2955821648

Cites:

Cited by: 2

Related to: 9