Intersection types and λ-definability

DOI10.1017/S0960129502003833zbMath1029.03005OpenAlexW2131196037MaRDI QIDQ4405687

Antonio Bucciarelli, Ivano Salvo, Adolfo Piperno

Publication date: 8 February 2004

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129502003833

zbMATH Keywords

lambda calculusintersection typestypingCurry typesfunction definability

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Combinatory logic and lambda calculus (03B40)

Related Items (3)

A type assignment for \(\lambda\)-calculus complete both for FPTIME and strong normalization ⋮ How to think of intersection types as Cartesian products ⋮ Unnamed Item

This page was built for publication: Intersection types and λ-definability