THEORETICAL PEARLS: A bargain for intersection types: a simple strong normalization proof

DOI10.1017/S0956796805005587zbMath1104.68013OpenAlexW2152894518MaRDI QIDQ5695115

Peter Møller Neergaard

Publication date: 11 October 2005

Published in: Journal of Functional Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (2)

Strong normalization through intersection types and memory ⋮ Intersection Types for the Resource Control Lambda Calculi

This page was built for publication: THEORETICAL PEARLS: A bargain for intersection types: a simple strong normalization proof