Copyright | (C) 2020-2022 Bellroy Pty Ltd |
---|---|
License | BSD-3-Clause |
Maintainer | Bellroy Tech Team <haskell@bellroy.com> |
Stability | experimental |
Safe Haskell | Safe-Inferred |
Language | Haskell2010 |
Reimplement a few lens types and combinators to keep the dependency footprint down.
Documentation
type Prism' s a = forall p f. (Choice p, Applicative f) => p a (f a) -> p s (f s) Source #