Search

• < Previous
• 1
• Next >

---

Full Abstraction for the Resource Lambda Calculus with Tests, through Taylor Expansion

Thomas Ehrhard ; Antonio Bucciarelli ; Alberto Carraro ; Giulio Manzonetto.

We study the semantics of a resource-sensitive extension of the lambda calculus in a canonical reflexive object of a category of sets and relations, a relational version of Scott's original model of the pure lambda calculus. This calculus is related to Boudol's resource calculus and is derived from&nbsp;[&hellip;]

---

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 inhabitation in an intersection type system P based on non-idempotent types. We show first that the system P characterizes the&nbsp;[&hellip;]

---

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 several type assignment systems, which characterize the solvable or the strongly normalizing lambda-terms. We prove the&nbsp;[&hellip;]

---