Conditional linearization

DOI10.1016/S0019-3577(99)80012-3zbMath1025.03502OpenAlexW4210515731MaRDI QIDQ698633

R. C. de Vrijer

Publication date: 22 September 2002

Published in: Indagationes Mathematicae. New Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-3577(99)80012-3

zbMATH Keywords

normal formscombinatory logicterm rewriting systemconditional linearization

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)

Related Items

Highlights in infinitary rewriting and lambda calculus, Lambda calculus with patterns, Unique normal form property of compatible term rewriting systems: A new proof of Chew's theorem, Unnamed Item, Applications of infinitary lambda calculus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Conditional rewrite rules: Confluence and termination
• Unique normal forms for lambda calculus with surjective pairing
• Computing in systems described by equations
• The lambda calculus, its syntax and semantics
• \(\lambda\)-calculus and computer science theory. Proceedings of the symposium held in Rome, March 25-27, 1975
• Unique normal form property of Higher-Order Rewriting Systems
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Pairing Without Conventional Restraints
• Unique normal forms for nonlinear term rewriting systems: Root overlaps
• Extended term rewriting systems
• Unique normal form property of compatible term rewriting systems: A new proof of Chew's theorem