Proof-directed program transformation: a functional account of efficient regular expression matching
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3460178 (Why is no real title available?)
- scientific article; zbMATH DE number 1339873 (Why is no real title available?)
- scientific article; zbMATH DE number 236855 (Why is no real title available?)
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- scientific article; zbMATH DE number 3189697 (Why is no real title available?)
- A framework for defining logics
- Automata, Languages and Programming
- Bit-coded Regular Expression Parsing
- Definitional interpreters for higher-order programming languages
- EDUCATIONAL PEARL: ‘Proof-directed debugging’ revisited for a first-order version
- Fast Pattern Matching in Strings
- From regular expressions to deterministic automata
- Memoizing purely functional top-down backtracking language processors
- Practical foundations for programming languages
- Programming Techniques: Regular expression search algorithm
- Proof-directed debugging
- Regular-expression derivatives re-examined
Cited in
(6)- DReX: a declarative language for efficiently evaluating regular string transformations
- Regular expressions at their best: a case for rational design
- A play on regular expressions: functional pearl
- Proof-directed debugging
- More Efficient Left-to-Right Pattern Matching in Non-sequential Equational Programs
- Combining predicate transformer semantics for effects: a case study in parsing regular languages
This page was built for publication: Proof-directed program transformation: a functional account of efficient regular expression matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5016216)
