Comparing Böhm-Like Trees

DOI10.1007/978-3-642-02348-4_17MaRDI QIDQ3636829zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Rewriting Techniques and Applications
• Term Rewriting and Applications
• Partial order infinitary term rewriting and Böhm trees
• Highlights in infinitary rewriting and lambda calculus
• Infinitary combinatory reduction systems

Cites work

• Combinatory reduction systems: Introduction and survey
• scientific article; zbMATH DE number 3961577 (Why is no real title available?)
• scientific article; zbMATH DE number 1332646 (Why is no real title available?)
• scientific article; zbMATH DE number 937379 (Why is no real title available?)
• Infinitary lambda calculus
• On Confluence of Infinitary Combinatory Reduction Systems
• On Normalisation of Infinitary Combinatory Reduction Systems
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Rewriting Techniques and Applications
• Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
• Term Rewriting and Applications

Cited in

(6)

• Highlights in infinitary rewriting and lambda calculus
• Counterexamples in infinitary rewriting with non-fully-extended rules
• Infinitary rewriting: closure operators, equivalences and models
• Böhm trees as higher-order recursion schemes
• Abstract Böhm trees
• Rewriting Techniques and Applications

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3636829)