madgen / exalogLinks
Semi-naïve typed Datalog backend with runtime, transformations, and foreign predicate support
☆16Updated 5 years ago
Alternatives and similar repositories for exalog
Users that are interested in exalog are comparing it to the libraries listed below
Sorting:
- Label dependent dependent session types☆16Updated last year
- A Datalog extension to reason about time with CTL operators☆14Updated 5 years ago
- Austin's supercompiler work☆21Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆48Updated 4 years ago
- ☆35Updated 7 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 9 months ago
- Higher kinded polymorphism in a language with unboxed, statically sized datatypes.☆51Updated 7 months ago
- An implementation of Ben Lippmeier's "Don't Substitute Into Abstractions"☆15Updated 7 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 12 years ago
- Build Status A Haskell implementation of the ZKBoo protocol for non-interactive zero-knowledge arguments of boolean circuits.☆18Updated 7 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- A compiler for a simple language using llvm☆35Updated 2 years ago
- Authenticated Data Structures☆16Updated 10 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- used to be something more ambitious, cut scope to just a simple compiler for thesis project☆17Updated 6 years ago
- BDD-based implementation of Datalog☆37Updated 5 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Distributed Protocol Combinators☆13Updated 4 years ago
- A dependent type theory with user defined data types☆47Updated 3 years ago
- a self-hosting lambda calculus compiler☆37Updated 5 months ago
- Compositional type checking for a Hindley-Milner type system☆11Updated 8 years ago
- Map lazy functional language constructs to LLVM IR☆50Updated 6 years ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Updated 7 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- being an experiment with potato power☆23Updated 5 years ago
- ICFP tutorial☆39Updated 4 years ago