2026-07-22T07:05:29Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:4200 2024-03-06T10:34:52Z ddc:004 open_access

Innocent Game Semantics via Intersection Type Assignment Systems Di Gianantonio, Pietro Lenisa, Marina Game Semantics Intersection Type Assignment System Lambda Calculus The aim of this work is to correlate two different approaches to the semantics of programming languages: game semantics and intersection type assignment systems (ITAS). Namely, we present an ITAS that provides the description of the semantic interpretation of a typed lambda calculus in a game model based on innocent strategies. Compared to the traditional ITAS used to describe the semantic interpretation in domain theoretic models, the ITAS presented in this paper has two main differences: the introduction of a notion of labelling on moves, and the omission of several rules, i.e. the subtyping rules and some structural rules. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Pietro Di Gianantonio and Marina Lenisa 2013 Is Part Of LIPIcs, Volume 23, Computer Science Logic 2013 (CSL 2013) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CSL.2013.231 urn:nbn:de:0030-drops-42005 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2013.231 eng https://creativecommons.org/licenses/by/3.0/legalcode