circuithub / fast-downward
Solve classical planning problems (STRIPS/SAS+) using Haskell & Fast Downward
☆32Updated last year
Alternatives and similar repositories for fast-downward:
Users that are interested in fast-downward are comparing it to the libraries listed below
- Generate a command line client from a servant API☆28Updated last year
- Maps using values' monoidal structure during merging☆42Updated 2 weeks ago
- rewrite rules for type-level equalities☆62Updated last year
- An experiment in functional interface design☆23Updated 8 years ago
- Kleene algebra, regular expressions☆32Updated last year
- Literally the best anonymous records☆35Updated 2 years ago
- ☆34Updated 3 years ago
- A Generic implementation of data-has.☆22Updated 4 years ago
- There are many category theory implementations, but this one is mine☆16Updated 8 months ago
- ☆31Updated 4 years ago
- Recover run-time type information from the GHC heap. One example use case is a "show anything" function (with no Show constraint).☆35Updated last month
- type classes and deriving via for encoding☆21Updated 5 years ago
- Demonstrating how to make type families faster using typechecker plugins☆21Updated 4 years ago
- Automatic type class law checking.☆24Updated 3 months ago
- A library for generic programming that aims to be easy to understand☆26Updated last month
- Automation of Haskell package release process.☆31Updated last year
- Extensible type-safe unions for Haskell☆33Updated last month
- Efficient non-empty variants of containers data types, with full API☆26Updated 9 months ago
- Safe web routing in haskell☆30Updated 2 years ago
- generate contextually sensible fuzz tests for servant apps☆26Updated 5 months ago
- Invertible parsing for S-expressions☆34Updated 3 weeks ago
- ☆20Updated 2 years ago
- Guess-A-Number game in Haskell using Polysemy☆28Updated 2 years ago
- Deriving Storable instances using GHC.Generics☆16Updated 3 years ago
- Use Pandoc to write simple reports within haskell code. Inspired by R-markdown.☆29Updated 3 months ago
- Code to go along with the blog post "Are Mutable References in Haskell Fast?"☆10Updated 7 years ago
- A benchmark comparing different ways of building a strict bytestring in Haskell☆25Updated 2 years ago
- Helpers which allow safe partial pattern matching in lambdas☆31Updated 4 years ago
- GHC prof manipulation script☆32Updated last year
- DEPRECATED use autodocodec instead An optparse-applicative -style explainable yaml parser.☆28Updated 3 years ago