Some Programming Languages Suggested by Game Models (Extended Abstract)

DOI10.1016/j.entcs.2009.07.087zbMath1337.68073OpenAlexW2152841619MaRDI QIDQ2805154

John Longley

Publication date: 10 May 2016

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

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.07.087

zbMATH Keywords

definabilitygame semanticsbacktrackingcoroutineslinear typesFPCsequential data structures

Mathematics Subject Classification ID

Theory of programming languages (68N15) Data structures (68P05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

From global to local state, coalgebraically and compositionally ⋮ Imperative programs as proofs via game semantics

Uses Software

• Eriskay

Cites Work

• Sequential algorithms on concrete data structures
• LCF considered as a programming language
• The sequentially realizable functionals
• Games and full abstraction for FPC.
• Comparing hierarchies of types in models of linear logic
• Locally Boolean domains
• A Categorical Semantics of Higher Order Store
• Definability and Full Abstraction
• Games and full completeness for multiplicative linear logic
• On the symmetry of sequentiality
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some Programming Languages Suggested by Game Models (Extended Abstract)