Re:Ask HN: Best talks of 2018?
by agentultra on Monday December 24, 2018 @01:18PM
(#18753402)
If you're building a parser, you may use: http://hackage.haskell.org/package/parsec-3.1.13.0/docs/Text...
Where your downstream parsers match on `Nothing` and assume the stream hasn't been consumed in order to try an alternative parser or provide a default.
If you change an equation to use `option` instead you have a completely different parser with different semantics.
I was thinking of a case where I use your function in a combinator that depends on the Functor and Monoid instances provided by the `Maybe` type. If you change your function to return only the `a` and it doesn't provide those instances then you've changed the contract and have broken my code. And I suspect it should be easy to prove the equations are not equivalent.
I don't really follow that. How can it be a breaking change? Can you give an example?