15 citations · 24 across the 5 of their papers we have counts for
5 papers
Solvability = Typability + Inhabitation
Antonio Bucciarelli, Delia Kesner, Simona Ronchi Della Rocca
We extend the classical notion of solvability to a lambda-calculus equipped with pattern matching. We prove that solvability can be characterized by means of typability and inhabit…
Inhabitation for Non-idempotent Intersection Types
Antonio Bucciarelli, Delia Kesner, Simona Ronchi Della Rocca
The inhabitation problem for intersection types in the lambda-calculus is known to be undecidable. We study the problem in the case of non-idempotent intersection, considering seve…
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…
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…
Proceedings 6th Workshop on Logical and Semantic Frameworks with Applications
Simona Ronchi della Rocca, Elaine Pimentel
This volume contains the proceedings of the Sixth Workshop on Logical and Semantic Frameworks with Applications (LSFA 2011). The workshop will be hold in Belo Horizonte, on August…