successors: An applicative functor to manage successors
This package provides the
Control.Applicative.Successors.Succs functor. It models
a node in a graph together with its successors. The
Applicative (and Monad) instances are designed so that
the successors of the resulting value take exactly one
step, either in the left or the right argument to <*>
(or >>=).
Downloads
- successors-0.1.0.2.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
| Versions [RSS] | 0.1, 0.1.0.1, 0.1.0.2, 0.1.0.3 |
|---|---|
| Change log | ChangeLog.md |
| Dependencies | base (>=4.8 && <4.15) [details] |
| License | MIT |
| Copyright | 2017 Joachim Breitner |
| Author | Joachim Breitner |
| Maintainer | mail@joachim-breitner.de |
| Category | Control |
| Home page | https://github.com/nomeata/haskell-successors |
| Source repo | head: git clone https://github.com/nomeata/haskell-successors |
| Uploaded | by JoachimBreitner at 2021-02-22T13:12:50Z |
| Distributions | NixOS:0.1.0.3 |
| Reverse Dependencies | 1 direct, 0 indirect [details] |
| Downloads | 1898 total (2 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2021-02-22 [all 1 reports] |