chessai / hsdatalogLinks
BDD-based implementation of Datalog
☆37Updated 5 years ago
Alternatives and similar repositories for hsdatalog
Users that are interested in hsdatalog are comparing it to the libraries listed below
Sorting:
- ICFP tutorial☆39Updated 3 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- Haskell embedding of PlusCal☆61Updated 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- Quasiquoter for LLVM☆31Updated 7 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Low-overhead effect management for concrete monads☆37Updated 3 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- a self-hosting lambda calculus compiler☆35Updated 2 months ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- Invertible parsing for S-expressions☆34Updated 2 months ago
- IO using sized types and copatterns☆35Updated 4 years ago
- An efficient graph library for Haskell☆39Updated last month
- A framework for defining text adventures via Haskell files. Play by combining functions, not by guessing phrases.☆32Updated 5 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- ☆47Updated 3 weeks ago
- Toy version of Git/Mercurial built using recursion schemes. Implements lazy diffing and merging of merkle dir trees. Solves toy versions …☆3Updated 3 years ago
- classical sequent calculus, embedded in Haskell☆20Updated 3 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- A Teeny Type Theory☆26Updated 3 years ago
- do-notation for Category and "Arrow without arr"☆63Updated 8 years ago
- ☆23Updated last year
- A simple implementation of linear type theory☆38Updated 8 years ago
- Fast equality saturation in Haskell☆84Updated 4 months ago
- A library for benign effects in Haskell☆20Updated last month