e8781f12c0
This PR changes the definition of the iterator combinators `takeWhileM` and `dropWhileM` so that they use `MonadAttach`. This is only relevant in rare cases, but makes it sometimes possible to prove such combinators finite when the finiteness depends on properties of the monadic predicate. |
||
|---|---|---|
| .. | ||
| Combinators | ||
| Consumers | ||
| Internal | ||
| Lemmas | ||
| Producers | ||
| Basic.lean | ||
| Combinators.lean | ||
| Consumers.lean | ||
| Internal.lean | ||
| Lemmas.lean | ||
| PostconditionMonad.lean | ||
| Producers.lean | ||
| ToIterator.lean | ||