Polarized games

DOI10.1016/J.APAL.2004.04.006zbMATH Open1055.03020OpenAlexW4205415028MaRDI QIDQ1886321FDOQ1886321

Olivier Laurent

Publication date: 18 November 2004

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2004.04.006

Recommendations

• scientific article; zbMATH DE number 1223612
• Polarized category theory, modules, and game semantics
• scientific article; zbMATH DE number 1497810
• Game semantics for call-by-value polymorphism
• Thick Subtrees, Games and Experiments

zbMATH Keywords

Linear logicGame semanticsControl categoriesLambda-mu calculusPolarities

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Cites Work

• Full abstraction for idealized Algol with passive expressions
• On full abstraction for PCF: I, II and III
• Full abstraction for PCF
• Title not available (Why is that?)
• Premonoidal categories and notions of computation
• Linear logic
• Locus solum: From the rules of logic to the logic of rules.
• Control categories and duality: On the categorical semantics of the lambda-mu calculus
• A new constructive logic: classic logic
• Title not available (Why is that?)
• A game semantics for linear logic
• Game-theoretic analysis of call-by-value computation
• The duality of computation
• Games and full completeness for multiplicative linear logic
• Title not available (Why is that?)
• On the symmetry of sequentiality
• Title not available (Why is that?)
• Polarized proof-nets and \(\lambda \mu\)-calculus
• Linear continuation-passing
• A new deconstructive logic: linear logic
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Call-by-push-value: Decomposing call-by-value and call-by-name
• Title not available (Why is that?)

Cited In (22)

• Computational ludics
• Jump from parallel to sequential proofs: exponentials
• Safe recursion revisited. I: Categorical semantics for lower complexity
• A game-semantic model of computation
• On the Meaning of Logical Completeness
• Title not available (Why is that?)
• On dialogue games and graph games
• Infinitary affine proofs
• Thick Subtrees, Games and Experiments
• On the Meaning of Focalization
• A game semantics of names and pointers
• Locally Boolean domains
• Dynamic game semantics
• Game semantics for access control
• An Indexed System for Multiplicative Additive Polarized Linear Logic
• A graphical foundation for interleaving in game semantics
• Totality in arena games
• From Focalization of Logic to the Logic of Focalization
• A Categorical Setting for Lower Complexity
• Syntax vs. semantics: A polarized approach
• Game semantics and linear CPS interpretation
• Automata, Languages and Programming

This page was built for publication: Polarized games

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