Strict intersection types for the Lambda Calculus

DOI10.1145/1922649.1922657zbMath1293.68073OpenAlexW2099162225MaRDI QIDQ2875057

Steffen van Bakel

Publication date: 13 August 2014

Published in: ACM Computing Surveys (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1922649.1922657

zbMATH Keywords

approximationnormalization\(\lambda\)-calculusprincipal pairsfilter semanticsstrict intersection types

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Combinatory logic and lambda calculus (03B40)

Related Items (5)

Nominal essential intersection types ⋮ Semantic types and approximation for Featherweight Java ⋮ Completeness and partial soundness results for intersection and union typing for \(\overline{\lambda}\mu\tilde{\mu}\) ⋮ Strong normalization through intersection types and memory ⋮ Functional Type Assignment for Featherweight Java

This page was built for publication: Strict intersection types for the Lambda Calculus