research
∙
08/15/2023
Infinitary cut-elimination via finite approximations
We investigate non-wellfounded proof systems based on parsimonious logic...
share
research
∙
02/28/2023
Computational expressivity of (circular) proofs with fixed points
We study the computational expressivity of proof systems with fixed poin...
research
∙
11/29/2022
Non-uniform complexity via non-wellfounded proofs
Cyclic and non-wellfounded proofs are now increasingly employed to estab...
research
∙
10/03/2021
Cyclic Implicit Complexity
Circular (or cyclic) proofs have received increasing attention in recent...
research
∙
04/28/2021
Linear Additives
We introduce 𝖫𝖠𝖬, a subsystem of 𝖨𝖬𝖠𝖫𝖫_2 with restricted additive rules ...
research
∙
07/03/2020
Probabilistic Soft Type Assignment
We model randomized complexity classes in the style of Implicit Computat...
research
∙
04/27/2020
The Benefit of Being Non-Lazy in Probabilistic λ-calculus
We consider the probabilistic applicative bisimilarity (PAB), a coinduct...
research
∙
12/30/2019