flow: Write more understandable Haskell.

[ combinators, functions, library, mit, utility ] [ Propose Tags ]

Flow provides operators for writing more understandable Haskell.


[Skip to Readme]

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 1.0.0, 1.0.1, 1.0.2, 1.0.4, 1.0.5, 1.0.6, 1.0.7, 1.0.8, 1.0.9, 1.0.10, 1.0.11, 1.0.12, 1.0.13, 1.0.14, 1.0.15, 1.0.17, 1.0.18, 1.0.19, 1.0.20, 1.0.21, 1.0.22, 1.0.23, 2.0.0.0 (info)
Change log CHANGELOG.md
Dependencies base (<5) [details]
License MIT
Author
Maintainer Taylor Fausak
Category Combinators, Functions, Utility
Home page https://github.com/tfausak/flow#readme
Bug tracker https://github.com/tfausak/flow/issues
Source repo head: git clone https://github.com/tfausak/flow
Uploaded by fozworth at 2017-12-20T14:44:50Z
Distributions LTSHaskell:2.0.0.0, NixOS:2.0.0.0, Stackage:2.0.0.0
Downloads 12199 total (66 in the last 30 days)
Rating 2.5 (votes: 4) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2017-12-20 [all 1 reports]

Readme for flow-1.0.10

[back to package description]

Flow

Write more understandable Haskell.

Version badge Build badge

Flow is a package that provides functions and operators for writing more understandable Haskell. It is an alternative to some common idioms like ($) for function application and (.) for function composition.

Requirements

Flow requires a Haskell compiler. It is tested with recent versions of GHC, but older or different compilers should be acceptable. For installation with Cabal, Flow requires at least Cabal 1.8.

Installation

To add Flow as a dependency to your package, add it to your Cabal file.

build-depends: flow ==1.0.*

See the change log for a detailed list of changes.

Usage

Flow is designed to be imported unqualified. It does not export anything that conflicts with the base package.

import Flow

Cheat sheet

Flow Base
x |> f x & f
f <| x f $ x
apply x f f x
f .> g f >>> g
g <. f g . f
compose f g x g (f x)
x !> f -
f <! x f $! x
apply' x f seq x (f x)

For more information about Flow, please read the Haddock documentation.