Comparing Böhm-Like Trees

DOI10.1007/978-3-642-02348-4_17zbMath1242.68135OpenAlexW2128217024MaRDI QIDQ3636829

Jeroen Ketema

Publication date: 30 June 2009

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02348-4_17

Mathematics Subject Classification ID

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

Related Items (3)

Infinitary rewriting: closure operators, equivalences and models ⋮ Highlights in infinitary rewriting and lambda calculus ⋮ Counterexamples in infinitary rewriting with non-fully-extended rules

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
• Combinatory reduction systems: Introduction and survey
• Infinitary lambda calculus
• On Normalisation of Infinitary Combinatory Reduction Systems
• On Confluence of Infinitary Combinatory Reduction Systems
• Term Rewriting and Applications
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Rewriting Techniques and Applications

This page was built for publication: Comparing Böhm-Like Trees