One-step recurrent terms in \(\lambda\)-\(\beta\)-calculus

DOI10.1016/0304-3975(88)90079-5zbMath0647.03009OpenAlexW2479147788MaRDI QIDQ1104313

Sachio Hirokawa, Shoji Sekimoto

Publication date: 1988

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(88)90079-5

zbMATH Keywords

\(\lambda \)-\(\beta \) calculusrecurrent term

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reduction graphs in the lambda calculus
• The lambda calculus, its syntax and semantics
• Church-Rosser strategies in the lambda calculus
• Minimal forms inλ-cakulus computations

This page was built for publication: One-step recurrent terms in \(\lambda\)-\(\beta\)-calculus