Last updated: 2019-11-24 19:09:29 +0000
Upstream URL: git clone http://chriswarbo.net/git/bucketing-algorithms.git
Contents of README follows
Contact: chriswarbo@gmail.com
Homepage: http://chriswarbo.net/git/bucketing-algorithms
Mirrors:
<ul> <li>/ipns/QmWv958VzBJQchGjYKiSaxLC9ugrjvXkqMpVrmjp9AonXq</li> <li>https://github.com/Warbo/bucketing-algorithms</li> </ul>This program is free software: you can redistribute it and/or modify it under the terms of the GNU Affero General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.
This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Affero General Public License for more details.
You should have received a copy of the GNU Affero General Public License along with this program. If not, see http://www.gnu.org/licenses/.
This repo contains algorithms which take in a JSON array of (Haskell Core) ASTs and spits out an array of arrays (“buckets”). Each “bucket” is an array of strings, where those strings come from the “name” attributes of the given ASTs.
The idea of “bucketing” in this way is to try and group “related” ASTs together, most notably as a way to carve up large packages into sub-sets suitable for “theory exploration” tools like QuickSpec and Speculate.