Parallel reductions in \(\lambda\)-calculus

DOI10.1016/S0747-7171(89)80045-8zbMath0661.03008MaRDI QIDQ5903814

Masako Takahashi

Publication date: 1989

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

\(\lambda\)-calculusparallel reduction

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items (12)

\(F\)-semantics for type assignment systems ⋮ The Church-Rosser theorem and quantitative analysis of witnesses ⋮ Parametric parameter passing \(\lambda\)-calculus ⋮ Adding proof objects and inductive definition mechanisms to frege structures ⋮ Domain-Freeλµ-Calculus ⋮ A typed \(\lambda\)-calculus for proving-by-example and bottom-up generalization procedure ⋮ Expression reduction systems with patterns ⋮ Simplified Reducibility Proofs of Church-Rosser for β- and βη-reduction ⋮ A simplified proof of the Church-Rosser theorem ⋮ Strong Normalization with Singleton Types ⋮ A Framework for Defining Logical Frameworks ⋮ Combinatory reduction systems: Introduction and survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Parallel reductions in \(\lambda\)-calculus