A pattern matching compiler for multiple target languages

DOI10.1007/3-540-36579-6_5MaRDI QIDQ4417783zbMATH OpenFDO

Authors Pierre-Etienne Moreau, Christophe Ringeissen, Marian Vittek

Publication date 30 July 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2622/26220061.htm

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Computing methodologies and applications (68U99)

Recommendations

• Compiling regular patterns
• Parallel tree pattern matching
• Nonlinear pattern matching in trees
• scientific article; zbMATH DE number 3864481
• scientific article; zbMATH DE number 4060735

Cited in

(13)

• GC\(^{2}\): a generational conservative garbage collector for the ATERM library
• Term-graph rewriting in \textsc{Tom} using relative positions
• Canonical abstract syntax trees
• scientific article; zbMATH DE number 3864481 (Why is no real title available?)
• Termination of Priority Rewriting
• Pattern matching for the masses using custom notations
• scientific article; zbMATH DE number 1533832 (Why is no real title available?)
• Programming Languages and Systems
• Proving weak properties of rewriting
• Pattern matching compilation of functions defined in context-free languages
• Multi-pattern languages
• A \(\rho\)-calculus of explicit constraint application
• Anti-patterns for rule-based languages

Describes a project that uses

Uses Software

• Haskell
• Eiffel
• ATERM

This page was built for publication: A pattern matching compiler for multiple target languages

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