Polymorphic game semantics for dynamic binding

DOI10.4230/LIPICS.CSL.2016.27MaRDI QIDQ5278413zbMATH OpenOpenAlexFDO

Authors James Laird

Publication date 19 July 2017

Full work available at URL http://opus.bath.ac.uk/52458/

zbMATH Keywords

game semanticsPCFdenotational modelsIdealized Algol

Mathematics Subject Classification ID

Theory of programming languages (68N15) 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 bounded polymorphism
• Game semantics for call-by-value polymorphism
• scientific article; zbMATH DE number 1956502
• scientific article; zbMATH DE number 1231510

Cited in

(4)

• Block structure vs. scope extrusion: between innocence and omniscience
• Game semantics for bounded polymorphism
• Dynamic game semantics
• Block structure vs scope extrusion: between innocence and omniscience

This page was built for publication: Polymorphic game semantics for dynamic binding

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