ess: The type-level S combinator in Haskell.

[ data, library, mit ] [ Propose Tags ]

[Skip to Readme]

Modules

For package maintainers and hackage trustees

Candidates

Versions [RSS]	0.1.0.0
Dependencies	base (>=4.7 && <4.8) [details]
License	MIT
Author	Michael Church
Maintainer	michael.o.church@gmail.com
Category	Data
Home page	https://github.com/michaelochurch/ess
Uploaded	by MichaelOChurch at 2015-04-25T02:30:24Z
Distributions
Reverse Dependencies	1 direct, 0 indirect [details]
Downloads	1069 total (5 in the last 30 days)
Rating	(no votes yet) [estimated by Bayesian average]
Your Rating	λ λ λ
Status	Docs available [build log] Last success reported on 2015-04-25 [all 1 reports]

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.