Research on integrating datalog & lambda calculus via monotonicity types
☆417Jun 21, 2022Updated 3 years ago
Alternatives and similar repositories for datafun
Users that are interested in datafun are comparing it to the libraries listed below
Sorting:
- A less devious proof assistant☆231Jan 23, 2023Updated 3 years ago
- DDlog is a programming language for incremental computation. It is well suited for writing programs that continuously update their output…☆1,483Jul 7, 2023Updated 2 years ago
- Engines, queries, and data for dynamic Datalog computation☆134Aug 4, 2021Updated 4 years ago
- The Makam Metalanguage☆204Mar 7, 2023Updated 3 years ago
- A fast implementation of miniKanren with disequality and absento, compatible with Racket and Chez.☆167Feb 4, 2025Updated last year
- A Racket library for interacting with Idris over the IDE protocol☆31Nov 10, 2017Updated 8 years ago
- ☆11Jul 20, 2016Updated 9 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆150Sep 30, 2021Updated 4 years ago
- Kanren with databases☆44Jul 30, 2024Updated last year
- Functional programming with fewer indirections☆780Aug 20, 2020Updated 5 years ago
- Soufflé is a variant of Datalog for tool designers crafting analyses in Horn clauses. Soufflé synthesizes a native parallel C++ program f…☆1,059Dec 10, 2025Updated 3 months ago
- An Introduction to Redex with Abstracting Abstract Machines☆105Mar 21, 2024Updated 2 years ago
- Formalizations of strong normalization proofs☆35Jul 8, 2019Updated 6 years ago
- Various experiments in relational programming☆274Feb 27, 2022Updated 4 years ago
- IODyn: A functional language for implicitly-incremental programs with dynamic input and output collections☆15Feb 22, 2018Updated 8 years ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- An in-memory datalog implementation for OCaml.☆277Updated this week
- A friendly little systems language with first-class types. Very WIP! 🚧 🚧 🚧☆624May 16, 2021Updated 4 years ago
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 years ago
- ☆138Jun 2, 2022Updated 3 years ago
- ☆29Sep 14, 2015Updated 10 years ago
- A simple implementation of linear type theory☆39Apr 21, 2017Updated 8 years ago
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- Dyna2 compiler and REPL☆149Jun 14, 2020Updated 5 years ago
- Demo for high-performance type theory elaboration☆585Feb 2, 2026Updated last month
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago
- A lightweight Datalog engine in Rust☆861Dec 14, 2025Updated 3 months ago
- multi-stage relational programming for staged relational interpreters: running with holes, faster☆139Nov 29, 2025Updated 3 months ago
- The Flix Programming Language☆2,592Updated this week
- Dependently-typed language with Iverson-style implicit lifting☆126Mar 24, 2020Updated 5 years ago
- Frank compiler☆306Apr 23, 2024Updated last year
- Toy typechecker for Insanely Dependent Types☆82Oct 15, 2025Updated 5 months ago
- miniKanren with a first-order representation of the search space☆17Mar 11, 2026Updated last week
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations☆391Oct 23, 2023Updated 2 years ago
- A diagram drawing library for Racket☆20Dec 16, 2020Updated 5 years ago
- Fungi: Typed incremental computation with names☆70Oct 11, 2019Updated 6 years ago
- The Alms Programming Language☆44Aug 29, 2018Updated 7 years ago
- Staged compilation with dependent types☆187Feb 1, 2026Updated last month