Axioms for the Theory of Lambda-Conversion

DOI10.1137/0214028zbMath0587.03008OpenAlexW1981336276WikidataQ114615486 ScholiaQ114615486MaRDI QIDQ3714048

György E. Révész

Publication date: 1985

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0214028

zbMATH Keywords

replacementlambda calculussubstitutionrenamingprogram for computing normal form of lambda-terms

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Software, source code, etc. for problems pertaining to mathematical logic and foundations (03-04)

Related Items (4)

Substitution revisited ⋮ On explicit substitution with names ⋮ Formalisation in constructive type theory of Stoughton's substitution for the lambda calculus ⋮ Capturing strong reduction in director string calculus

Uses Software

• PL/I

This page was built for publication: Axioms for the Theory of Lambda-Conversion