Research on integrating datalog & lambda calculus via monotonicity types
☆416Jun 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:
- DDlog is a programming language for incremental computation. It is well suited for writing programs that continuously update their output…☆1,477Jul 7, 2023Updated 2 years ago
- A less devious proof assistant☆231Jan 23, 2023Updated 3 years ago
- A fast implementation of miniKanren with disequality and absento, compatible with Racket and Chez.☆167Feb 4, 2025Updated last year
- The Makam Metalanguage☆200Mar 7, 2023Updated 2 years ago
- Engines, queries, and data for dynamic Datalog computation☆133Aug 4, 2021Updated 4 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,056Dec 10, 2025Updated 2 months ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆150Sep 30, 2021Updated 4 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Nov 10, 2017Updated 8 years ago
- Dependently-typed language with Iverson-style implicit lifting☆126Mar 24, 2020Updated 5 years ago
- Various experiments in relational programming☆273Feb 27, 2022Updated 4 years ago
- Kanren with databases☆44Jul 30, 2024Updated last year
- Functional programming with fewer indirections☆781Aug 20, 2020Updated 5 years ago
- Formalizations of strong normalization proofs☆35Jul 8, 2019Updated 6 years ago
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 years ago
- An in-memory datalog implementation for OCaml.☆276Oct 17, 2024Updated last year
- IODyn: A functional language for implicitly-incremental programs with dynamic input and output collections☆15Feb 22, 2018Updated 8 years ago
- ☆11Jul 20, 2016Updated 9 years ago
- multi-stage relational programming for staged relational interpreters: running with holes, faster☆139Nov 29, 2025Updated 3 months ago
- An Introduction to Redex with Abstracting Abstract Machines☆104Mar 21, 2024Updated last year
- A friendly little systems language with first-class types. Very WIP! 🚧 🚧 🚧☆630May 16, 2021Updated 4 years ago
- miniKanren with a first-order representation of the search space☆17Jul 23, 2024Updated last year
- Toy typechecker for Insanely Dependent Types☆82Oct 15, 2025Updated 4 months ago
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- The Flix Programming Language☆2,587Updated this week
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34May 27, 2017Updated 8 years ago
- 1ML prototype interpreter☆292Jun 28, 2020Updated 5 years ago
- A simple implementation of linear type theory☆39Apr 21, 2017Updated 8 years ago
- ☆29Sep 14, 2015Updated 10 years ago
- Frank compiler☆305Apr 23, 2024Updated last year
- syn·di·cate: a language for interactive programs☆160Dec 18, 2025Updated 2 months ago
- A language-integrated proof assistant, for and in Racket☆39Aug 26, 2016Updated 9 years ago
- An efficient implementation of the higher-order logic programming language Lambda Prolog☆172Apr 21, 2024Updated last year
- ☆138Jun 2, 2022Updated 3 years ago
- Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations☆390Oct 23, 2023Updated 2 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago
- A demo implementation of a simple dependently-typed language☆619Nov 18, 2024Updated last year
- Demo for high-performance type theory elaboration☆585Feb 2, 2026Updated 3 weeks ago
- A lightweight Datalog engine in Rust☆861Dec 14, 2025Updated 2 months ago