Overall Objectives
Research Program
Application Domains
New Results
- Functional programming with -tree syntax
- Mechanized metatheory revisited
- New applications of Foundational Proof Certificates
- Historical reflections on proof theory and logic programming
- Intuitionistic proofs without syntax
- Towards a combinatorial proof theory
- Combinatorial Proofs for Logics of Relevance and Entailment
- On combinatorial proofs for modal logic
- Deep inference and expansion trees for second-order multiplicative linear logic
- A fully labelled proof system for intuitionistic modal logics
- Types by Need
- Sharing Equality is Linear
- Crumbling Abstract Machines
- Factorization and Normalization, Essentially
- A Fresh Look at the -Calculus
- Abstract Machines for Open Call-by-Value
Bilateral Contracts and Grants with Industry
Partnerships and Cooperations
Bibliography
Overall Objectives
Research Program
Application Domains
New Results
- Functional programming with -tree syntax
- Mechanized metatheory revisited
- New applications of Foundational Proof Certificates
- Historical reflections on proof theory and logic programming
- Intuitionistic proofs without syntax
- Towards a combinatorial proof theory
- Combinatorial Proofs for Logics of Relevance and Entailment
- On combinatorial proofs for modal logic
- Deep inference and expansion trees for second-order multiplicative linear logic
- A fully labelled proof system for intuitionistic modal logics
- Types by Need
- Sharing Equality is Linear
- Crumbling Abstract Machines
- Factorization and Normalization, Essentially
- A Fresh Look at the -Calculus
- Abstract Machines for Open Call-by-Value
Bilateral Contracts and Grants with Industry
Partnerships and Cooperations
Bibliography
Previous | 
Home