An insertion operator preserving infinite reduction sequences

DOI10.1017/S0960129508006816zbMath1153.68025MaRDI QIDQ3520149

David Chemouil

Publication date: 15 August 2008

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

zbMATH Keywords

reduction systems

Mathematics Subject Classification ID

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

Cites Work

• The lambda calculus. Its syntax and semantics. Rev. ed.
• Combining algebraic rewriting, extensional lambda calculi, and fixpoints
• Isomorphisms of simple inductive types through extensional rewriting
• On the union of well-founded relations
• Term Rewriting and All That

This page was built for publication: An insertion operator preserving infinite reduction sequences