Skip to content

/ lfc-haskell

🔮 An experiment with the simply typed lambda calculus, recursion schemes, Cofree, and extensible effects

View license
6 stars 0 forks
Star
Watch
master
2 branches 0 tags
Go to file
Code

Clone with HTTPS

Use Git or checkout with SVN using the web URL.

Latest commit

@romac
romac Update README.
437f847 Mar 1, 2017
Update README.
437f847

Git stats

Files

Permalink
Failed to load latest commit information.
Type
Name
Latest commit message
Commit time
src/LFC
Replace monad transformers with freer's implementation of extensible …
Mar 1, 2017
.gitignore
Initial commit.
Oct 4, 2016
.travis.yml
Send build notifications to Slack.
Oct 4, 2016
LICENSE
Rename to LFC.
Feb 15, 2017
README.md
Update README.
Mar 1, 2017
Setup.hs
Initial commit.
Oct 4, 2016
lfc.cabal
Replace monad transformers with freer's implementation of extensible …
Mar 1, 2017
package.yaml
Replace monad transformers with freer's implementation of extensible …
Mar 1, 2017
stack.yaml
Replace monad transformers with freer's implementation of extensible …
Mar 1, 2017

README.md

Lambda calculus + recursion schemes + Cofree

Build Status Issues Status License Contact

An experiment with lambda calculus, recursion schemes, Cofree and extensible effects.

Author

Romain Ruetschi

License

This code is released under the BSD3 license.

About

🔮 An experiment with the simply typed lambda calculus, recursion schemes, Cofree, and extensible effects

Topics

haskell recursion-schemes lambda-calculus fixed-points

Resources

Readme

License

View license

Releases

No releases published

Packages

No packages published

Languages

You can’t perform that action at this time.