An Account of Implementing Applicative Term Rewriting

DOI10.1016/J.ENTCS.2007.02.049zbMath1277.68109OpenAlexW2140403461WikidataQ126244388 ScholiaQ126244388MaRDI QIDQ2866805

Muck J. Van Weerdenburg

Publication date: 6 December 2013

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

Full work available at URL: https://doi.org/10.1016/j.entcs.2007.02.049

zbMATH Keywords

open termsefficient rewritingnonlinear match trees

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (1)

Unnamed Item

Uses Software

• ATERM
• Maude
• JITty
• ASF+SDF
• mCRL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Refined compilation of pattern-matching for functional languages
• Maude: specification and programming in rewriting logic
• Compositional verification of asynchronous concurrent systems using CADP
• Just-in-time
• A compiler for nondeterministic term rewriting systems

This page was built for publication: An Account of Implementing Applicative Term Rewriting