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 4 years ago
- Map lazy functional language constructs to LLVM IR☆51Updated 6 years ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 7 years ago
- Profunctor optics for the endofunctor category on Hask☆27Updated 5 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Generic functions for single-sorted first-order structural unification☆45Updated 7 months ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- GRIN backend for Idris☆50Updated 5 years ago
- rewrite rules for type-level equalities☆62Updated 3 months ago
- Haskell embedding of PlusCal☆62Updated 3 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 5 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 5 years ago
- Fast equality saturation in Haskell☆91Updated last month
- IO using sized types and copatterns☆36Updated 4 years ago
- ⛏️ A refinement proof framework for haskell☆70Updated 2 years ago
- Compositional type checking for Haskell☆38Updated 14 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated last month
- Example language server (LSP) implementation for a toy language☆60Updated 4 years ago
- A monadic approach to static analysis following the methodology of AAM☆18Updated 10 years ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Updated 7 years ago
- ☆16Updated 3 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- A library for doing generic programming in Agda☆34Updated 4 years ago
- Fast polynomial arithmetic in Haskell (dense and sparse, univariate and multivariate, usual and Laurent)☆69Updated 3 months ago
- NbE course @ Chalmers☆28Updated last year