A game semantics for generic polymorphism

DOI10.1016/j.apal.2004.10.002zbMath1066.68074arXiv1312.1120OpenAlexW2567841577WikidataQ57006657 ScholiaQ57006657MaRDI QIDQ1772770

Radha Jagadeesan, Samson Abramsky

Publication date: 21 April 2005

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.1120

zbMATH Keywords

game semanticsSystem Fsecond-order \(\lambda\)-calculuscategorical model of program polymorphismgeneric polymorphism

Mathematics Subject Classification ID

Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Categorical logic, topoi (03G30) Combinatory logic and lambda calculus (03B40)

Related Items

Games for Dependent Types, Game semantics for dependent types, Game semantics of Martin-Löf type theory, Logic and Geometry of Agents in Agent-Based Modeling, Realisability semantics of parametric polymorphism, general references and recursive types, Game Semantics for Bounded Polymorphism

Uses Software

• Esterel

Cites Work

• A small complete category
• Formal parametric polymorphism
• The genericity theorem and parametricity in the polymorphic \(\lambda\)- calculus
• Full abstraction for PCF
• Categorical semantics for higher order polymorphic lambda calculus
• Categories for Types
• Games and full completeness for multiplicative linear logic
• Geometry of Interaction and linear combinatory algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item