2 citations · 2 across the 6 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.LO2021
Cyclic Implicit Complexity
Gianluca Curzi, Anupam Das
Circular (or cyclic) proofs have received increasing attention in recent years, and have been proposed as an alternative setting for studying (co)inductive reasoning. In particular…
cs.LO2021
Linear Additives
Gianluca Curzi
We introduce LAM, a subsystem of IMALL2 with restricted additive rules able to manage duplication linearly, called linear additive rules. LAM is presented as the type assignment sy…