https://github.com/sgraf812/worklist

Worklistish algorithm in Haskell
https://github.com/sgraf812/worklist

Last synced: about 2 months ago
JSON representation

Worklistish algorithm in Haskell

• Host: GitHub
• URL: https://github.com/sgraf812/worklist
• Owner: sgraf812
• License: isc
• Created: 2016-12-09T08:58:54.000Z (about 8 years ago)
• Default Branch: master
• Last Pushed: 2016-12-28T17:03:25.000Z (about 8 years ago)
• Last Synced: 2024-10-13T10:42:36.235Z (3 months ago)
• Language: Haskell
• Size: 8.79 KB
• Stars: 0
• Watchers: 3
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • Changelog: CHANGELOG.md
  • License: LICENSE

Awesome Lists containing this project

README

        
`worklist` [![Build Status](https://travis-ci.org/sgraf812/worklist.svg?branch=master)](https://travis-ci.org/sgraf812/worklist)

==========

Library for a simple worklist implementation with dynamic edges. Intentionally

does not build on top of the lattice abstraction, shifting that responsibility

into transfer functions.

This is all work in progress documentation and performance wise, but should

mostly work by now.