POSIX Lexing with Derivatives of Regular Expressions (Proof Pearl)
From MaRDI portal
Publication:2829247
Recommendations
- POSIX lexing with derivatives of regular expressions
- POSIX regular expression parsing with derivatives
- Regular-expression derivatives re-examined
- Formalising Boost POSIX regular expression matching
- Formalising and implementing Boost POSIX regular expression matching
- Derivatives of regular expressions and an application
- Partial derivatives of an extended regular expression
- Manipulation of regular expressions using derivatives: an overview
- Two-sided derivatives for regular expressions and for hairpin expressions
- Two-sided derivatives for regular expressions and for hairpin expressions
Cites work
- A Decision Procedure for Regular Expression Equivalence in Type Theory
- Adapting functional programs to higher order logic
- Automata, Languages and Programming
- Derivatives of Regular Expressions
- POSIX Lexing with Derivatives of Regular Expressions (Proof Pearl)
- POSIX regular expression parsing with derivatives
- Proof Pearl: regular expression equivalence and relation algebra
Cited in
(6)
This page was built for publication: POSIX Lexing with Derivatives of Regular Expressions (Proof Pearl)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829247)