Search

• < Previous
• 1
• Next >

---

Light Logics and the Call-by-Value Lambda Calculus

Paolo Coppola ; Ugo Dal Lago ; Simona Ronchi Della Rocca.

The so-called light logics have been introduced as logical systems enjoying quite remarkable normalization properties. Designing a type assignment system for pure lambda calculus from these logics, however, is problematic. In this paper we show that shifting from usual call-by-name to call-by-value&nbsp;[&hellip;]

---

Standardization and Conservativity of a Refined Call-by-Value lambda-Calculus

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&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;]

---

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;]

---