Canonical Abstract Syntax Trees

DOI10.1016/J.ENTCS.2007.06.014zbMath1279.68070OpenAlexW2024180633MaRDI QIDQ2873780

Antoine Reilles

Publication date: 24 January 2014

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.06.014

zbMATH Keywords

rewrite systemdata representationsyntax treesGOM

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42) Data structures (68P05)

Related Items (2)

Term Collections in λ and ρ-calculi ⋮ Term-graph Rewriting in Tom Using Relative Positions

Uses Software

• ATERM
• Maude

Cites Work

• Unnamed Item
• Unnamed Item
• Generation of abstract programming interfaces from syntax definitions
• Normalized rewriting: An alternative to rewriting modulo a set of equations
• Formal Validation of Pattern Matching code
• A system of interaction and structure

This page was built for publication: Canonical Abstract Syntax Trees