An implementation of Martin Escardo's exhaustively searchable sets in Haskell.
Why do you think that https://github.com/sebfisch/incremental-sat-solver is a good alternative to infinite-search
An implementation of Martin Escardo's exhaustively searchable sets in Haskell.
Why do you think that https://github.com/sebfisch/incremental-sat-solver is a good alternative to infinite-search