| Publication | Date of Publication | Type |
|---|
Categorical Proof-Theoretic Semantics
(available as arXiv preprint) | N/A | Paper |
Continuations and Completeness in Proof-theoretic Semantics
(available as arXiv preprint) | 2026-01-01 | Paper |
Categorical proof-theoretic semantics
Studia Logica | 2025-02-17 | Paper |
| Skolemisation for intuitionistic linear logic | 2025-01-31 | Paper |
Proof-terms for classical and intuitionistic resolution
Automated Deduction — Cade-13 | 2019-01-15 | Paper |
On the intuitionistic force of classical search (extended abstract)
Theorem Proving with Analytic Tableaux and Related Methods | 2019-01-10 | Paper |
On explicit substitutions and names (extended abstract)
Automata, Languages and Programming | 2018-07-04 | Paper |
| Fibrational modal type theory | 2018-04-23 | Paper |
Stateful applied pi calculus: observational equivalence and labelled bisimilarity
Journal of Logical and Algebraic Methods in Programming | 2017-05-29 | Paper |
A proof-theoretic analysis of the classical propositional matrix method
Journal Of Logic And Computation | 2014-04-01 | Paper |
Model checking agent knowledge in dynamic access control policies
Tools and Algorithms for the Construction and Analysis of Systems | 2013-08-05 | Paper |
Model checking agent knowledge in dynamic access control policies
Tools and Algorithms for the Construction and Analysis of Systems | 2013-08-05 | Paper |
| Basic constructive modality | 2013-04-24 | Paper |
| A Parigot-style linear -calculus for full intuitionistic linear logic | 2006-12-19 | Paper |
| A Parigot-style linear -calculus for full intuitionistic linear logic | 2006-12-19 | Paper |
Financial Cryptography and Data Security
Lecture Notes in Computer Science | 2005-12-22 | Paper |
| scientific article; zbMATH DE number 2185675 (Why is no real title available?) | 2005-07-04 | Paper |
Relating categorical semantics for intuitionistic linear logic
Applied Categorical Structures | 2005-06-16 | Paper |
| scientific article; zbMATH DE number 2095713 (Why is no real title available?) | 2004-08-31 | Paper |
Linear explicit substitutions
Logic Journal of the IGPL | 2004-01-28 | Paper |
| scientific article; zbMATH DE number 1848312 (Why is no real title available?) | 2003-01-01 | Paper |
On the semantics of classical disjunction
Journal of Pure and Applied Algebra | 2002-03-11 | Paper |
Categorical models for intuitionistic and linear type theory
Lecture Notes in Computer Science | 2001-02-27 | Paper |
A generic strong normalization argument: Application to the calculus of constructions
Lecture Notes in Computer Science | 2001-01-22 | Paper |
Normalisation for typed lambda calculi with explicit substitution
Lecture Notes in Computer Science | 2001-01-22 | Paper |
Proof-terms for classical and intuitionistic resolution
Journal Of Logic And Computation | 2000-09-04 | Paper |
On the intuitionistic force of classical search
Theoretical Computer Science | 2000-08-23 | Paper |
Characterising explicit substitutions which preserve termination. (Extended abstract)
Lecture Notes in Computer Science | 2000-03-09 | Paper |
Categorical models of explicit substitutions
Lecture Notes in Computer Science | 1999-11-22 | Paper |
Explicit substitutions for constructive necessity
Lecture Notes in Computer Science | 1998-11-15 | Paper |
Categorical abstract machines for higher-order typed -calculi
Theoretical Computer Science | 1997-02-27 | Paper |
