circuithub / fast-downward
Solve classical planning problems (STRIPS/SAS+) using Haskell & Fast Downward
☆32Updated last year
Related projects ⓘ
Alternatives and complementary repositories for fast-downward
- Maps using values' monoidal structure during merging☆42Updated 5 months ago
- rewrite rules for type-level equalities☆62Updated 7 months ago
- Literally the best anonymous records☆36Updated last year
- Easy bidirectional serialization in Haskell☆50Updated 5 years ago
- DEPRECATED use autodocodec instead An optparse-applicative -style explainable yaml parser.☆28Updated 3 years ago
- Generate a command line client from a servant API☆29Updated 10 months ago
- Efficient non-empty variants of containers data types, with full API☆25Updated 4 months ago
- Nat, Fin, Vec☆24Updated last week
- Tools for functors from Hask^k to Hask☆23Updated 5 years ago
- Extensible type-safe unions for Haskell☆32Updated 2 months ago
- experimenting with unlifted classes via backpack☆36Updated 2 years ago
- Automatic type class law checking.☆24Updated 11 months ago
- Type-level sets for Haskell (with value-level counterparts and various operations)☆66Updated 11 months ago
- high-resolution performance benchmarking☆25Updated last month
- ☆34Updated 3 years ago
- coverage driven random testing framework☆21Updated 2 weeks ago
- Dual Traversable☆41Updated last year
- Existential type.☆36Updated 6 months ago
- lazy generators with observation☆15Updated last year
- Code to go along with the blog post "Are Mutable References in Haskell Fast?"☆10Updated 7 years ago
- 🤳 ignore the differences between `a` and `Identity a`☆25Updated 5 years ago
- Example repository setup that deploys GHCJS programs to GitHub Pages☆24Updated 5 years ago
- Batteries-included structured logging library☆29Updated 2 months ago
- Symbol manipulation☆36Updated last year
- There are many category theory implementations, but this one is mine☆14Updated 3 months ago
- Wailing into the primordial ooze of category theory☆54Updated last week
- Automation of Haskell package release process.☆31Updated last year
- Recover run-time type information from the GHC heap. One example use case is a "show anything" function (with no Show constraint).☆33Updated 5 months ago
- Signature inference for Functional Property Discovery in Haskell☆36Updated 7 years ago
- Profunctor optics for the endofunctor category on Hask☆27Updated 4 years ago