PATTERN MATCHING CODE MINIMIZATION IN REWRITING-BASED PROGRAMMING LANGUAGES

DOI10.1142/S0129054102001515MaRDI QIDQ3021992zbMATH OpenOpenAlexFDO

Authors Nadia Nedjah, Luiza de Macedo Mourelle

Publication date 22 June 2005

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054102001515

zbMATH Keywords

dag automatonpattern matchingterm rewritingtree automaton

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 1949659
• scientific article; zbMATH DE number 1708150
• scientific article; zbMATH DE number 2089879
• Pattern-matching algorithms based on term rewrite systems
• More Efficient Left-to-Right Pattern Matching in Non-sequential Equational Programs

Cites work

• Adaptive Pattern Matching
• Fast Pattern Matching in Strings
• Implementation of an interpreter for abstract equations
• Pattern Matching in Trees

Cited in

(7)

• Pattern-matching algorithms based on term rewrite systems
• Code generation based on formal BURS theory and heuristic search
• scientific article; zbMATH DE number 1638660 (Why is no real title available?)
• scientific article; zbMATH DE number 1708150 (Why is no real title available?)
• scientific article; zbMATH DE number 1949659 (Why is no real title available?)
• Pattern minimization problems over recursive data types
• Pattern matching compilation of functions defined in context-free languages

This page was built for publication: PATTERN MATCHING CODE MINIMIZATION IN REWRITING-BASED PROGRAMMING LANGUAGES

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