Game Semantics for Bounded Polymorphism

DOI10.1007/978-3-662-49630-5_4zbMath1475.68065OpenAlexW2344079541MaRDI QIDQ2811332

James Laird

Publication date: 10 June 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://opus.bath.ac.uk/49940/1/fos16.pdf

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• Functorial polymorphism
• A modest model of records, inheritance, and bounded quantification
• An extension of system \(F\) with subtyping
• A game semantics for generic polymorphism
• Game Semantics for Call-by-Value Polymorphism
• Coherence of subsumption, minimum typing and type-checking in F ≤

This page was built for publication: Game Semantics for Bounded Polymorphism