| Publication | Date of Publication | Type |
|---|
MacNeille Completion and Buchholz' Omega Rule for Parameter-Free Second Order Logics
(available as arXiv preprint) | 2022-05-28 | Paper |
| Semantic evaluation; intersection types and complexity of simply typed lambda calculus | 2020-05-27 | Paper |
| scientific article; zbMATH DE number 6792338 (Why is no real title available?) | 2017-10-17 | Paper |
Algebraic proof theory: hypersequents and hypercompletions
Annals of Pure and Applied Logic | 2016-12-23 | Paper |
From focalization of logic to the logic of focalization
Electronic Notes in Theoretical Computer Science | 2016-07-08 | Paper |
Densification of FL chains via residuated frames
Algebra Universalis | 2016-04-07 | Paper |
Parsimonious types and non-uniform computation
Automata, Languages, and Programming | 2015-11-04 | Paper |
Algebraic proof theory for substructural logics: cut-elimination and completions
Annals of Pure and Applied Logic | 2012-04-13 | Paper |
MacNeille completions of FL-algebras
Algebra Universalis | 2011-12-14 | Paper |
Disjunction property and complexity of substructural logics
Theoretical Computer Science | 2011-07-18 | Paper |
Computational ludics
Theoretical Computer Science | 2011-05-10 | Paper |
On the meaning of logical completeness
Logical Methods in Computer Science | 2011-03-08 | Paper |
On the meaning of focalization
Ludics, Dialogue and Interaction | 2011-03-04 | Paper |
On the computational complexity of cut-elimination in linear logic.
Lecture Notes in Computer Science | 2010-02-23 | Paper |
Expanding the Realm of Systematic Proof Theory
Computer Science Logic | 2009-11-12 | Paper |
On the Meaning of Logical Completeness
Lecture Notes in Computer Science | 2009-07-07 | Paper |
Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic
Computer Science Logic | 2009-03-12 | Paper |
Light types for polynomial time computation in lambda calculus
Information and Computation | 2009-03-02 | Paper |
Modular Cut-Elimination: Finding Proofs or Counterexamples
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-27 | Paper |
Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic
Logical Methods in Computer Science | 2008-04-01 | Paper |
Which structural rules admit cut elimination? An algebraic criterion
Journal of Symbolic Logic | 2007-10-17 | Paper |
Light affine lambda calculus and polynomial time strong normalization
Archive for Mathematical Logic | 2007-04-19 | Paper |
Intuitionistic phase semantics is almost classical
Mathematical Structures in Computer Science | 2006-05-22 | Paper |
Towards a semantic characterization of cut-elimination
Studia Logica | 2006-03-17 | Paper |
Typed Lambda Calculi and Applications
Lecture Notes in Computer Science | 2005-11-11 | Paper |
Light affine set theory: A naive set theory of polynomial time
Studia Logica | 2004-08-16 | Paper |
The finite model property for various fragments of intuitionistic linear logic
Journal of Symbolic Logic | 2000-02-09 | Paper |
| scientific article; zbMATH DE number 1377618 (Why is no real title available?) | 1999-12-14 | Paper |
| scientific article; zbMATH DE number 1305936 (Why is no real title available?) | 1999-11-08 | Paper |
