Non-idempotent intersection types for the Lambda-Calculus

DOI10.1093/jigpal/jzx018zbMath1405.03036OpenAlexW2760585651MaRDI QIDQ4644585

Delia Kesner, Daniel Lima Ventura, Antonio Bucciarelli

Publication date: 8 January 2019

Published in: Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/jigpal/jzx018

zbMATH Keywords

intersection typestype systemsquantitative semanticsprincipal typinginhabitation problemsnormalization properties

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items (17)

Unnamed Item ⋮ Non-Deterministic Functions as Non-Deterministic Processes (Extended Version) ⋮ Type inference for rank-2 intersection types using set unification ⋮ A strong call-by-need calculus ⋮ Structural rules and algebraic properties of intersection types ⋮ Quantitative weak linearisation ⋮ Node Replication: Theory And Practice ⋮ Quantitative global memory ⋮ Tight typings and split bounds, fully developed ⋮ Unnamed Item ⋮ The spirit of node replication ⋮ Unnamed Item ⋮ The bang calculus revisited ⋮ Unnamed Item ⋮ The bang calculus revisited ⋮ Unnamed Item ⋮ Resourceful program synthesis from graded linear types

This page was built for publication: Non-idempotent intersection types for the Lambda-Calculus