An elementary proof of strong normalization for intersection types

DOI10.1007/S001530000070zbMath1021.03005OpenAlexW2054325829MaRDI QIDQ1407502

Silvio Valentini

Publication date: 16 September 2003

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001530000070

zbMATH Keywords

lambda calculusintersection typesstrong normalization

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Combinatory logic and lambda calculus (03B40)

Related Items (5)

A resource aware semantics for a focused intuitionistic calculus ⋮ A binary modal logic for the intersection types of lambda-calculus. ⋮ Strong normalization through intersection types and memory ⋮ A domain model characterising strong normalisation ⋮ Unnamed Item

This page was built for publication: An elementary proof of strong normalization for intersection types