POPL 2022 (series) / POPL Research Papers / A Fine-Grained Computational Interpretation of Girard’s Intuitionistic Proof-Nets
A Fine-Grained Computational Interpretation of Girard’s Intuitionistic Proof-NetsInPerson
This paper introduces a functional term calculus, called pn, that captures the essence of the operational semantics of Intuitionistic Linear Logic Proof-Nets with a faithful degree of granularity, both statically and dynamically.
Fri 21 JanDisplayed time zone: Eastern Time (US & Canada) change
Fri 21 Jan
Displayed time zone: Eastern Time (US & Canada) change
10:20 - 12:00 | |||
10:20 25mResearch paper | From Enhanced Coinduction towards Enhanced InductionRemote POPL Davide Sangiorgi University of Bologna; Inria DOI Media Attached | ||
10:45 25mResearch paper | A Fine-Grained Computational Interpretation of Girard’s Intuitionistic Proof-NetsInPerson POPL Delia Kesner Université de Paris; CNRS; IRIF; Institut Universitaire de France DOI Media Attached | ||
11:10 25mResearch paper | Fully Abstract Models for Effectful λ-Calculi via Category-Theoretic Logical RelationsRemote POPL Ohad Kammar University of Edinburgh, Shin-ya Katsumata National Institute of Informatics, Philip Saville University of Oxford DOI Media Attached | ||
11:35 25mResearch paper | Layered and Object-Based Game SemanticsInPerson POPL Arthur Oliveira Vale Yale University, Paul-André Melliès CNRS; Université de Paris, Zhong Shao Yale University, Jérémie Koenig Yale University, Leo Stefanesco IRIF, University Paris Diderot & CNRS DOI Media Attached | ||