Explicit Substitutions and Reducibility

DOI10.1093/LOGCOM/11.3.431zbMath0984.03014OpenAlexW2002288870MaRDI QIDQ2752530

Hugo Herbelin

Publication date: 5 May 2002

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

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

zbMATH Keywords

reducibility\(\lambda\)-calculusstrong normalizationexplicit substitutions

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items (3)

Intersection types for explicit substitutions ⋮ Call-by-name reduction and cut-elimination in classical logic ⋮ A type-theoretic foundation of delimited continuations

This page was built for publication: Explicit Substitutions and Reducibility