3 results
Giulio Guerrieri ; Luca Paolini ; Simona Ronchi Della Rocca.
We study an extension of Plotkin's call-by-value lambda-calculus via two commutation rules (sigma-reductions). These commutation rules are sufficient to remove harmful call-by-value normal forms from the calculus, so that it enjoys elegant characterizations of many semantic properties. We prove that […]
Published on December 22, 2017
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 several type assignment systems, which characterize the solvable or the strongly normalizing lambda-terms. We prove the […]
Published on August 3, 2018
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 inhabitation in an intersection type system P based on non-idempotent types. We show first that the system P characterizes the […]
Published on January 29, 2021