Compiling regular patterns

DOI10.1145/944705.944712zbMATH Open1315.68077OpenAlexW2083270921MaRDI QIDQ5261267FDOQ5261267

Michael Y. Levin

Publication date: 2 July 2015

Published in: Proceedings of the eighth ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/944705.944712

zbMATH Keywords

compilationpattern matching

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Cited In (3)

• Some methods for ``normalizing patterns
• Title not available (Why is that?)
• Regular expression pattern matching for XML

   Recommendations

• CONCUR 2004 - Concurrency Theory 👍 👎
• Title not available (Why is that?) 👍 👎
• Regular expression patterns 👍 👎
• Pattern Matching 👍 👎
• Algorithms for the compilation of regular expressions into PLAs 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On matching generalised repetitive patterns 👍 👎
• Optimizing pattern matching 👍 👎
• Database Programming Languages 👍 👎

This page was built for publication: Compiling regular patterns

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