Proof-directed program transformation: A functional account of efficient regular expression matching

DOI10.1017/S0956796820000295OpenAlexW3165564340MaRDI QIDQ5016216

Andrzej Filinski

Publication date: 13 December 2021

Published in: Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0956796820000295

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• From regular expressions to deterministic automata
• Memoizing purely functional top-down backtracking language processors
• Definitional interpreters for higher-order programming languages
• Practical Foundations for Programming Languages
• Bit-coded Regular Expression Parsing
• EDUCATIONAL PEARL: ‘Proof-directed debugging’ revisited for a first-order version
• Regular-expression derivatives re-examined
• A framework for defining logics
• Fast Pattern Matching in Strings
• Proof-directed debugging
• Automata, Languages and Programming
• Programming Techniques: Regular expression search algorithm

This page was built for publication: Proof-directed program transformation: A functional account of efficient regular expression matching