1.2k citations
- Université Sorbonne Paris NordFR291 papers
- Centre National de la Recherche ScientifiqueFR216 papers
- Sorbonne Paris CitéFR64 papers
- Sorbonne UniversitéFR40 papers
- Université Paris CitéFR34 papers
- Laboratoire de Physique Théorique de la Matière CondenséeFR32 papers
- Laboratoire Bordelais de Recherche en InformatiqueFR20 papers
- Institut national de recherche en sciences et technologies du numériqueFR19 papers
- The Open UniversityGB19 papers
- Institute of Nuclear Physics, Polish Academy of SciencesPL18 papers
- Université Pierre-et-Marie-CurieFR18 papers
- Horia Hulubei National Institute for R and D in Physics and Nuclear EngineeringRO17 papers
4 papers · 2 filters
Interactive Realizability and the elimination of Skolem functions in Peano Arithmetic
Federico Aschieri, Margherita Zorzi
We present a new syntactical proof that first-order Peano Arithmetic with Skolem axioms is conservative over Peano Arithmetic alone for arithmetical formulas. This result - which s…
Full Abstraction for the Resource Lambda Calculus with Tests, through Taylor Expansion
Thomas Ehrhard, Antonio Bucciarelli, Alberto Carraro +1
We study the semantics of a resource-sensitive extension of the lambda calculus in a canonical reflexive object of a category of sets and relations, a relational version of Scott's…
An Abstract Approach to Stratification in Linear Logic
Pierre Boudes, Damiano Mazza, Lorenzo Tortora de Falco
We study the notion of stratification, as used in subsystems of linear logic with low complexity bounds on the cut-elimination procedure (the so-called light logics), from an abstr…
Quantitative classical realizability
Aloïs Brunel
Introduced by Dal Lago and Hofmann, quantitative realizability is a technique used to define models for logics based on Multiplicative Linear Logic. A particularity is that functio…