Game Semantics for Bounded Polymorphism

DOI10.1007/978-3-662-49630-5_4zbMATH Open1475.68065OpenAlexW2344079541MaRDI QIDQ2811332FDOQ2811332

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)

Cites Work

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

Cited In (1)

• Title not available (Why is that?)

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)