https://github.com/ekmett/bound
Last synced: about 2 months ago
Repository metadata:
Combinators for manipulating locally-nameless generalized de Bruijn terms
- Host: GitHub
- URL: https://github.com/ekmett/bound
- Owner: ekmett
- License: other
- Created: 2012-06-16T00:36:20.000Z (over 12 years ago)
- Default Branch: master
- Last Pushed: 2024-08-02T15:21:41.000Z (5 months ago)
- Last Synced: 2024-10-29T22:00:42.281Z (2 months ago)
- Language: Haskell
- Homepage: https://www.schoolofhaskell.com/user/edwardk/bound
- Size: 475 KB
- Stars: 121
- Watchers: 17
- Forks: 30
- Open Issues: 9
-
Metadata Files:
- Readme: README.markdown
- Changelog: CHANGELOG.markdown
- License: LICENSE
- Authors: AUTHORS.markdown
Owner metadata:
- Name: Edward Kmett
- Login: ekmett
- Email:
- Kind: user
- Description: I write a lot of Haskell.
- Website: http://comonad.com
- Location: Farmington Hills, MI
- Twitter: kmett
- Company: Groq
- Icon url: https://avatars.githubusercontent.com/u/304657?v=4
- Repositories: 298
- Last Synced at: 2023-04-10T02:32:00.294Z
- Profile URL: https://github.com/ekmett
- Sponsor URL:
Committers metadata
Last synced: about 2 months ago
Total Commits: 264
Total Committers: 24
Avg Commits per committer: 11.0
Development Distribution Score (DDS): 0.542
Commits in past year: 4
Committers in past year: 2
Avg Commits per committer in past year: 2.0
Development Distribution Score (DDS) in past year: 0.25
| Name | Commits | |
|---|---|---|
| Edward Kmett | e****t@g****m | 121 |
| Ryan Scott | r****t@g****m | 70 |
| Oleg Grenrus | o****s@i****i | 30 |
| Samuel Gélineau | g****b@g****m | 8 |
| Nicolas Pouillard | n****d@g****m | 6 |
| David Feuer | D****r@g****m | 5 |
| Gabor Greif | g****f@g****m | 3 |
| Andrea Vezzosi | s****n@g****m | 2 |
| Olle Fredriksson | f****e@g****m | 2 |
| startling | t****3@g****m | 2 |
| Ryan Scott | r****t@g****m | 2 |
| Benjamin Hodgson | b****n | 1 |
| Jeremy Bi | b****u | 1 |
| Adrien Stalain | a****n@e****r | 1 |
| Alexey Khudyakov | a****y@g****m | 1 |
| Alois Cochard | a****d@g****m | 1 |
| Baldur Blöndal | b****t@g****m | 1 |
| Carter Tazio Schonwald | c****d@g****m | 1 |
| Eric Mertens | e****s@g****m | 1 |
| Gabriel Gonzalez | G****9@g****m | 1 |
| Herbert Valerio Riedel | h****r@g****g | 1 |
| Matvey B. Aksenov | m****v@g****m | 1 |
| Sebastian Graf | s****7@g****m | 1 |
| tomjaguarpaw | t****m@j****k | 1 |
Issue and Pull Request metadata
Last synced: about 2 months ago
Package metadata
- Total packages: 1
-
Total downloads:
- hackage: 37,735 total
- Total dependent packages: 3
- Total dependent repositories: 166
- Total versions: 39
- Total maintainers: 3
hackage: bound
We represent the target language itself as an ideal monad supplied by the user, and provide a Scope monad transformer for introducing bound variables in user supplied terms. Users supply a Monad and Traversable instance, and we traverse to find free variables, and use the Monad to perform substitution that avoids bound variables. Slides describing and motivating this approach to name binding are available online at: http://www.slideshare.net/ekmett/bound-making-de-bruijn-succ-less The goal of this package is to make it as easy as possible to deal with name binding without forcing an awkward monadic style on the user. With generalized de Bruijn term you can lift whole trees instead of just applying succ to individual variables, weakening the all variables bound by a scope and greatly speeding up instantiation. By giving binders more structure we permit easy simultaneous substitution and further speed up instantiation.
- Homepage: http://github.com/ekmett/bound/
- Licenses: BSD-3-Clause
- Latest release: 2.0.7 (published over 1 year ago)
- Last Synced: 2024-11-11T03:10:18.108Z (about 2 months ago)
- Versions: 39
- Dependent Packages: 3
- Dependent Repositories: 166
- Downloads: 37,735 Total
-
Rankings:
- Dependent repos count: 2.91%
- Downloads: 3.775%
- Average: 5.376%
- Dependent packages count: 5.567%
- Forks count: 7.013%
- Stargazers count: 7.612%
- Maintainers (3)
Dependencies
- base >=4.9 && <5
- bifunctors ==5.*
- binary >=0.8.3 && <0.9
- bytes >=0.15.2 && <1
- cereal >=0.4.1 && <0.6
- comonad ==5.*
- deepseq >=1.4.2 && <1.5
- hashable >=1.2.5.0 && <1.5
- mmorph >=1.0 && <1.3
- profunctors >=3.3 && <6
- template-haskell >=2.11.1 && <3.0
- th-abstraction ==0.4.*
- transformers >=0.5 && <0.7
- transformers-compat >=0.5 && <1
- base >=4.5 && <5 test
- bound * test
- deriving-compat >=0.3.4 && <0.7 test
- transformers * test
- transformers-compat * test
- vector >=0.12 test
- void * test
- actions/cache v2 composite
- actions/checkout v2 composite
- base >=4.9 && <5
- bound *