Axiomatic rewriting theory II: the -calculus enjoys finite normalisation cones

DOI10.1093/LOGCOM/10.3.461zbMath0971.68082OpenAlexW2135458383MaRDI QIDQ4500179

Paul-André Melliès

Publication date: 30 October 2001

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/10.3.461

zbMATH Keywords

\(\lambda\)-calculus\(\lambda\sigma\)-calculus

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)

Related Items (2)

Normalisation for higher-order calculi with explicit substitutions ⋮ Unnamed Item

This page was built for publication: Axiomatic rewriting theory II: the   -calculus enjoys finite normalisation cones