BSD-3-Clause licensed and maintained by Oleg Grenrus
This version can be pinned in stack with:kleene-0.1@sha256:b847ac649c26353dc727d13ee2065dc7ef3f435ddd7751825ff3972d19dabd5d,2433

Kleene algebra

Think: Regular expressions

Implements ideas from Regular-expression derivatives re-examined by Scott Owens, John Reppy and Aaron Turon



  • Drop superclasses from Kleene.
  • Rearrange classes. Introduce CharKleene, FiniteKleene.
  • Add ToLatin1 and ability to match on ByteString.
  • Add Derivate c (DFA c) instance.
  • Add toDot to output DFA to be rendered by graphviz.
  • Add fromRE :: RE c -> ERE c
  • Add nullableProof :: RE c -> Maybe (RE c) which returns non-nullable part of given regular expression.
  • Support/require lattices-2: RE is now a Lattice, M isn’t.