https://github.com/ekmett/free

Last synced: about 1 month ago

Repository metadata:

free monads


Owner metadata:


Committers metadata

Last synced: about 1 month ago

Total Commits: 526
Total Committers: 63
Avg Commits per committer: 8.349
Development Distribution Score (DDS): 0.679

Commits in past year: 3
Committers in past year: 1
Avg Commits per committer in past year: 3.0
Development Distribution Score (DDS) in past year: 0.0

Name Email Commits
Edward Kmett e****t@g****m 169
Nickolay Kudasov n****v@g****m 106
Ryan Scott r****t@g****m 96
Víctor López Juan v****r@l****m 21
Oleg Grenrus o****s@i****i 11
Carl Howells c****9@g****m 9
ElvishJerricco e****o@g****m 9
Ryan Scott r****t@g****m 7
Eric Mertens e****s@g****m 5
[email protected] n****4@g****m 5
Edward Kmett e****t@a****l 4
Fabian b****n@g****m 4
Thomas Tuegel t****l@g****m 4
Matvey Aksenov m****v@g****m 3
Mateusz Kowalczyk f****u@f****k 3
Herbert Valerio Riedel h****r@g****g 3
Gurkenglas g****s@h****e 3
Nickolay Kudasov c****k@g****m 3
Oliver Charles o****e@o****k 3
Fumiaki Kinoshita f****l@g****m 3
M Farkas-Dyck s****8@g****m 2
Koji Miyazato v****c@g****m 2
John Wiegley j****w@n****m 2
Mitchell Rosen m****n@g****m 2
Rob Rix r****x@g****m 2
Sampsa Kiiskinen t****a@g****m 2
Dave Laing d****0@g****m 2
Aristid Breitkreuz a****b@g****m 2
Alastair Lynn a****n@g****m 2
Miles Gould m****s@a****k 2
and 33 more...

Issue and Pull Request metadata

Last synced: about 1 month ago


Package metadata

hackage: free

Free monads are useful for many tree-like structures and domain specific languages. If f is a Functor then the free Monad on f is the type of trees whose nodes are labeled with the constructors of f. The word "free" is used in the sense of "unrestricted" rather than "zero-cost": Free f makes no constraining assumptions beyond those given by f and the definition of Monad. As used here it is a standard term from the mathematical theory of adjoint functors. Cofree comonads are dual to free monads. They provide convenient ways to talk about branching streams and rose-trees, and can be used to annotate syntax trees. The cofree comonad can be seen as a stream parameterized by a Functor that controls its branching factor. More information on free monads, including examples, can be found in the following blog posts: https://ekmett.github.io/reader/2008/monads-for-free/ https://ekmett.github.io/reader/2011/free-monads-for-less/

  • Homepage: http://github.com/ekmett/free/
  • Licenses: BSD-3-Clause
  • Latest release: 5.1.10 (published about 2 years ago)
  • Last Synced: 2024-11-11T03:12:26.514Z (about 1 month ago)
  • Versions: 64
  • Dependent Packages: 57
  • Dependent Repositories: 542
  • Downloads: 259,616 Total
  • Docker Downloads: 35
  • Rankings:
    • Docker downloads count: 0.175%
    • Downloads: 0.356%
    • Dependent packages count: 0.565%
    • Dependent repos count: 0.774%
    • Average: 2.277%
    • Forks count: 5.182%
    • Stargazers count: 6.606%
  • Maintainers (4)
go: github.com/ekmett/free

  • Homepage:
  • Documentation: https://pkg.go.dev/github.com/ekmett/free#section-documentation
  • Licenses: other
  • Latest release: v5.1.10+incompatible (published about 2 years ago)
  • Last Synced: 2024-11-11T03:12:24.514Z (about 1 month ago)
  • Versions: 21
  • Dependent Packages: 0
  • Dependent Repositories: 0
  • Rankings:
    • Forks count: 3.114%
    • Stargazers count: 3.943%
    • Average: 6.859%
    • Dependent packages count: 9.576%
    • Dependent repos count: 10.802%

Dependencies

.github/workflows/haskell-ci.yml actions
  • actions/cache v2 composite
  • actions/checkout v2 composite
examples/free-examples.cabal hackage
  • HGL >=3.2.3.2
  • base >=4.9 && <5
  • comonad >=4 && <6
  • free *
  • monad-loops *
  • mtl >=2.0.1 && <2.4
  • rdtsc *
  • transformers >=0.2 && <0.7
  • transformers-compat >=0.6.4 && <0.8