More Efficient Left-to-Right Pattern Matching in Non-sequential Equational Programs

DOI10.1007/3-540-44888-8_22MaRDI QIDQ3550843zbMATH OpenOpenAlexFDO

Authors Nadia Nedjah, Luiza de Macedo Mourelle

Publication date 6 April 2010

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44888-8_22

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• scientific article; zbMATH DE number 2043417
• Proof-directed program transformation: a functional account of efficient regular expression matching
• Equations: a dependent pattern-matching compiler
• scientific article; zbMATH DE number 1822269
• Extensible pattern matching via a lightweight language extension
• scientific article; zbMATH DE number 1508936
• Nonlinear pattern matching in rule-based modeling languages

Cited in

(12)

• An improved bottom-up method for implementing equational programming language
• Pattern-matching algorithms based on term rewrite systems
• More efficient left-to-right matching for overlapping pattern
• scientific article; zbMATH DE number 1708150 (Why is no real title available?)
• PATTERN MATCHING CODE MINIMIZATION IN REWRITING-BASED PROGRAMMING LANGUAGES
• scientific article; zbMATH DE number 2043417 (Why is no real title available?)
• scientific article; zbMATH DE number 1497852 (Why is no real title available?)
• Adaptive non-linear pattern matching automata
• Left-to-right tree pattern matching
• Incremental techniques for efficient normalization of nonlinear rewrite systems
• Adaptive pattern matching
• High Performance Computing for Computational Science - VECPAR 2004

This page was built for publication: More Efficient Left-to-Right Pattern Matching in Non-sequential Equational Programs

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