Game semantics for bounded polymorphism

DOI10.1007/978-3-662-49630-5_4MaRDI QIDQ2811332zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Game semantics for a polymorphic programming language
• Game semantics for call-by-value polymorphism
• Polymorphic game semantics for dynamic binding
• scientific article; zbMATH DE number 1956502
• A modest model of records, inheritance, and bounded quantification

Cites work

• scientific article; zbMATH DE number 1223609 (Why is no real title available?)
• scientific article; zbMATH DE number 1259144 (Why is no real title available?)
• A game semantics for generic polymorphism
• A modest model of records, inheritance, and bounded quantification
• An extension of system \(F\) with subtyping
• Coherence of subsumption, minimum typing and type-checking in F ≤
• Functorial polymorphism
• Game semantics for a polymorphic programming language
• Game semantics for call-by-value polymorphism
• Linear logic

Cited in

(3)

• Game semantics for call-by-value polymorphism
• Polymorphic game semantics for dynamic binding
• scientific article; zbMATH DE number 1956502 (Why is no real title available?)

This page was built for publication: Game semantics for bounded polymorphism

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811332)