Term Rewriting and Applications

DOI10.1007/b135673zbMath1078.68658OpenAlexW2504734884MaRDI QIDQ5703868

Jeroen Ketema, Jakob Grue Simonsen

Publication date: 11 November 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b135673

Mathematics Subject Classification ID

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

Related Items (6)

Highlights in infinitary rewriting and lambda calculus ⋮ Counterexamples in infinitary rewriting with non-fully-extended rules ⋮ On Normalisation of Infinitary Combinatory Reduction Systems ⋮ Infinitary combinatory reduction systems ⋮ Comparing Böhm-Like Trees ⋮ Applications of infinitary lambda calculus

This page was built for publication: Term Rewriting and Applications