2 citations · 2 across the 1 of their papers we have counts for
4 papers
Non-uniform complexity via non-wellfounded proofs
Gianluca Curzi, Anupam Das
Cyclic and non-wellfounded proofs are now increasingly employed to establish metalogical results in a variety of settings, in particular for type systems with forms of (co)inductio…
Probabilistic Soft Type Assignment
Gianluca Curzi, Luca Roversi
We model randomized complexity classes in the style of Implicit Computational Complexity. We introduce PSTA, a probabilistic version of STA, the type-theoretical counterpart of Sof…
The Benefit of Being Non-Lazy in Probabilistic λ-calculus
Gianluca Curzi, Michele Pagani
We consider the probabilistic applicative bisimilarity (PAB), a coinductive relation comparing the applicative behaviour of probabilistic untyped lambda terms according to a specif…
A type-assignment of linear erasure and duplication
Gianluca Curzi, Luca Roversi
We introduce , a type-assignment system for the linear -calculus that extends second-order , i.e., intuitionistic multiplicative Linear Logic, by…