Canonical abstract syntax trees

DOI10.1016/J.ENTCS.2007.06.014MaRDI QIDQ2873780zbMATH OpenOpenAlexFDO

Authors 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

data representationGOMrewrite systemsyntax trees

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3848593
• Generation of abstract programming interfaces from syntax definitions
• A generic abstract syntax model for embedded languages
• scientific article; zbMATH DE number 4041306
• Object-oriented tree traversal with JJForester.

Cites work

• A system of interaction and structure
• Formal validation of pattern matching code
• Generation of abstract programming interfaces from syntax definitions
• scientific article; zbMATH DE number 1956456 (Why is no real title available?)
• Normalized rewriting: An alternative to rewriting modulo a set of equations
• Promoting rewriting to a programming language: A compiler for non-deterministic rewrite programs in associative-commutative theories

Cited in

(6)

• Generation of abstract programming interfaces from syntax definitions
• Term collections in {\(\lambda\)} and {\(\rho\)}-calculi
• Term-graph rewriting in \textsc{Tom} using relative positions
• scientific article; zbMATH DE number 3848593 (Why is no real title available?)
• scientific article; zbMATH DE number 5652625 (Why is no real title available?)
• A generic abstract syntax model for embedded languages

Describes a project that uses

Uses Software

• ATERM
• Maude

This page was built for publication: Canonical abstract syntax trees

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