ess: The type-level S combinator in Haskell.

[ data, library, mit ] [ Propose Tags ]
Dependencies base (==4.7.*) [details]
License MIT
Author Michael Church
Category Data
Home page
Uploaded by MichaelOChurch at Sat Apr 25 02:30:24 UTC 2015
Distributions NixOS:
Downloads 363 total (4 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2015-04-25 [all 1 reports]
Hackage Matrix CI

[Skip to Readme]




Maintainer's Corner

For package maintainers and hackage trustees

Readme for ess-

[back to package description]


A type-level S Combinator for Haskell.

I will be deeply impressed if anyone finds a use for this.

Why does it exist? We have a type-level I combinator in the Identity monad.

newtype Identity a = Identity {runIdentity :: a}

We also have a type-level K combinator in the Const functor.

newtype Const a b = Const {getConst :: a}

But where is our S combinator? More importantly, is it useful at all? This repository exists, because I want to know.