Quantitative Game Semantics for Linear Logic
From MaRDI portal
Publication:3540182
DOI10.1007/978-3-540-87531-4_18zbMATH Open1156.03332OpenAlexW1545860678MaRDI QIDQ3540182FDOQ3540182
Authors: Ugo Dal Lago, Olivier Laurent
Publication date: 20 November 2008
Published in: Computer Science Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-87531-4_18
Recommendations
Complexity of proofs (03F20) Proof-theoretic aspects of linear logic and other substructural logics (03F52)
Cited In (11)
- An abstract approach to stratification in linear logic
- Exact bounds for acyclic higher-order recursion schemes
- Game semantics and the geometry of backtracking: a new complexity analysis of interaction
- A game-semantic model of computation
- A semantic measure of the execution time in linear logic
- Title not available (Why is that?)
- A Fresh Look at the λ-Calculus
- Context semantics, linear logic, and computational complexity
- A game model for proofs with costs
- A parallel game semantics for linear logic
- Title not available (Why is that?)
This page was built for publication: Quantitative Game Semantics for Linear Logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540182)