Formal derivation of a pattern matching algorithm

DOI10.1016/0167-6423(89)90036-1zbMath0679.68011OpenAlexW2020938542MaRDI QIDQ1822923

Jeremy Gibbons, Geraint Jones, Richard S. Bird

Publication date: 1989

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6423(89)90036-1

zbMATH Keywords

pattern matchingfunctional programmingprogram derivationlists

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Related Items (7)

List partitions ⋮ Categories, relations and dynamic programming ⋮ A fast pattern matching algorithm derived by transformational and assertional reasoning ⋮ A sheaf-theoretic approach to pattern matching and related problems ⋮ Proof of Correctness of a Direct Construction of DFA from Regular Expression ⋮ The derivation of on-line algorithms, with an application to finding palindromes ⋮ Derivation of efficient logic programs by specialization and reduction of nondeterminism

This page was built for publication: Formal derivation of a pattern matching algorithm