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:
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- ICFP tutorial☆39Updated 3 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- Map lazy functional language constructs to LLVM IR☆50Updated 6 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆40Updated last year
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 7 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- ☆48Updated last month
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆81Updated 3 years ago
- UI experiments for coda☆66Updated 3 years ago
- ICFP 2019 preprints/papers☆44Updated 5 years ago
- Generic functions for single-sorted first-order structural unification☆46Updated 2 months ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Efficient parser combinators for Haskell☆39Updated last month
- being an experiment with potato power☆23Updated 5 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- A showcase of interesting code and proof developments in Cedille☆36Updated last month
- An efficient graph library for Haskell☆39Updated last month