sbv-8.7: SMT Based Verification: Symbolic Haskell theorem prover using SMT solving.

Copyright | (c) Joel Burget
License | BSD3
Maintainer | erkokl@gmail.com
Stability | experimental
Safe Haskell | None
Language | Haskell2010

Documentation.SBV.Examples.Strings.RegexCrossword

Description

This example solves regex crosswords from http://regexcrossword.com

Synopsis

- solveCrossword :: [RegExp] -> [RegExp] -> IO [String]
- puzzle1 :: IO [String]
- puzzle2 :: IO [String]
- puzzle3 :: IO [String]

# Documentation

solveCrossword :: [RegExp] -> [RegExp] -> IO [String] Source #

Solve a given crossword, returning the corresponding rows

puzzle1 :: IO [String] Source #

Solve http://regexcrossword.com/challenges/intermediate/puzzles/1

    >>> puzzle1
    ["ATO","WEL"]

puzzle2 :: IO [String] Source #

Solve http://regexcrossword.com/challenges/intermediate/puzzles/2

    >>> puzzle2
    ["WA","LK","ER"]

puzzle3 :: IO [String] Source #

Solve http://regexcrossword.com/challenges/palindromeda/puzzles/3

    >>> puzzle3
    ["RATS","ABUT","TUBA","STAR"]