Confluence of the lambda calculus with left-linear algebraic rewriting

DOI10.1016/0020-0190(92)90155-OzbMath0780.68079MaRDI QIDQ1197987

Fritz Müller

Publication date: 16 January 1993

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

confluencefunctional programming\(\beta\)-reductionterm rewriting systemuntyped \(\lambda\)-calculusChurch-Rosseralgebraic rewrite systemparallel conditional

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) General topics in the theory of software (68N01) Combinatory logic and lambda calculus (03B40)

Related Items (6)

More problems in rewriting ⋮ Problems in rewriting III ⋮ Higher-order rewrite systems and their confluence ⋮ Modular properties of algebraic type systems ⋮ On the confluence of lambda-calculus with conditional rewriting ⋮ Combinatory reduction systems: Introduction and survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Type inference with recursive types: Syntax and semantics
• The lambda calculus. Its syntax and semantics. Rev. ed.
• LCF considered as a programming language
• COMBINING TERM REWRITING AND TYPE ASSIGNMENT SYSTEMS
• Operational and Semantic Equivalence Between Recursive Programs
• Adding algebraic rewriting to the untyped lambda calculus (extended abstract)
• Tree-Manipulating Systems and Church-Rosser Theorems

This page was built for publication: Confluence of the lambda calculus with left-linear algebraic rewriting