2 citations · 2 across the 6 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.LO2023
Infinitary Cut-Elimination for Non-Wellfounded Parsimonious Linear Logic
Matteo Acclavio, Gianluca Curzi, Giulio Guerrieri
We investigate non-wellfounded proof systems based on parsimonious logic, a weaker variant of linear logic where the exponential modality ! is interpreted as a constructor for stre…
cs.LO2023
Computational expressivity of (circular) proofs with fixed points
Gianluca Curzi, Anupam Das
We study the computational expressivity of proof systems with fixed point operators, within the 'proofs-as-programs' paradigm. We start with a calculus muLJ (due to Clairambault) t…