A game semantics for generic polymorphism

DOI10.1007/3-540-36576-1_1MaRDI QIDQ4417848zbMATH OpenFDO

Authors Samson Abramsky, Radha Jagadeesan

Publication date 30 July 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2620/26200001.htm

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Abstract data types; algebraic specification (68Q65)

Recommendations

• A game semantics for generic polymorphism
• The genericity theorem and parametricity in the polymorphic \(\lambda\)- calculus
• Game semantics for a polymorphic programming language
• Game semantics for call-by-value polymorphism
• Game semantics for bounded polymorphism

Cited in

(10)

• Game semantics for dependent types
• A game semantics for generic polymorphism
• Second-order type isomorphisms through game semantics
• Genericity and the \(\pi\)-calculus
• Game semantics for bounded polymorphism
• Games for dependent types
• Game semantics for call-by-value polymorphism
• Deconstructing general references via game semantics
• Polymorphic game semantics for dynamic binding
• Game semantics for a polymorphic programming language

This page was built for publication: A game semantics for generic polymorphism

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