
TL;DR
This paper provides an overview of computability logic, a game-semantically based framework for interactive computational tasks, including a technical proof of affine logic's soundness within this semantics.
Contribution
It introduces computability logic as a novel game-semantical approach and proves the soundness of affine logic in this context.
Findings
Computability logic models interactive computational tasks.
Affine logic is sound under the semantics of computability logic.
Provides a comprehensive online resource on the subject.
Abstract
This article presents an overview of computability logic -- the game-semantically constructed logic of interactive computational tasks and resources. There is only one non-overview, technical section in it, devoted to a proof of the soundness of affine logic with respect to the semantics of computability logic. A comprehensive online source on the subject can be found at http://www.cis.upenn.edu/~giorgi/cl.html
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
