15 citations · 15 across the 2 of their papers we have counts for
2 papers
cs.LO2014
A type assignment for lambda-calculus complete both for FPTIME and strong normalization
Erika De Benedetti, Simona Ronchi Della Rocca
One of the aims of Implicit Computational Complexity is the design of programming languages with bounded computational complexity; indeed, guaranteeing and certifying a limited res…
cs.LO2013★ 15 cited
Bounding normalization time through intersection types
Erika De Benedetti, Simona Ronchi Della Rocca
Non-idempotent intersection types are used in order to give a bound of the length of the normalization beta-reduction sequence of a lambda term: namely, the bound is expressed as a…