An implementation of miniKanren in Haskell
☆79May 18, 2013Updated 12 years ago
Alternatives and similar repositories for MiniKanrenT
Users that are interested in MiniKanrenT are comparing it to the libraries listed below
Sorting:
- HaskellKanren (HK) is an implementation of the Kanren logic programming system in Haskell.☆24Sep 25, 2011Updated 14 years ago
- A typed logic programming language embedded in Haskell☆50Mar 3, 2013Updated 13 years ago
- ☆12May 9, 2015Updated 10 years ago
- ☆13Jan 7, 2026Updated last month
- Implementation of dependent type theory in SWI-Prolog☆10Oct 6, 2020Updated 5 years ago
- an encoding of affine effect handlers using pthreads☆14Nov 15, 2022Updated 3 years ago
- Relational algebra implementation in Agda with simple bindings to SQLITE☆13Oct 9, 2023Updated 2 years ago
- Strongly typed paths in Haskell☆16Nov 14, 2025Updated 3 months ago
- Cur dependently-typed language in miniKanren.☆17Jan 26, 2018Updated 8 years ago
- An implementation of Ben Lippmeier's "Don't Substitute Into Abstractions"☆15Aug 8, 2018Updated 7 years ago
- Funny little Haskell impl☆18Oct 28, 2020Updated 5 years ago
- ☆16Mar 11, 2022Updated 3 years ago
- a self-hosting lambda calculus compiler☆37Mar 31, 2025Updated 11 months ago
- An interpreter of F-ing modules☆19Jun 21, 2019Updated 6 years ago
- BDD-based implementation of Datalog☆38Jun 14, 2020Updated 5 years ago
- An efficient finite map from (byte)strings to values.☆20May 1, 2025Updated 10 months ago
- Formally verified operator language and rewriting engine for high-performance computing☆30Jun 13, 2024Updated last year
- classical sequent calculus, embedded in Haskell☆21Aug 24, 2025Updated 6 months ago
- Compositional type checking for Haskell☆38Apr 14, 2011Updated 14 years ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- 🧊 A Elbereth Gilthoniel / silivren penna míriel! 🌟☆19Jun 25, 2022Updated 3 years ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Mar 11, 2021Updated 4 years ago
- A Haskell game written in Yampa☆28Mar 7, 2024Updated last year
- Demo for dependent types + runtime code generation☆72Feb 18, 2025Updated last year
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Dec 5, 2024Updated last year
- A simple library for Haskell that allows relational programming.☆46Sep 12, 2012Updated 13 years ago
- n queens with the logic monad☆20Jan 10, 2015Updated 11 years ago
- ⛏️ A refinement proof framework for haskell☆71May 8, 2023Updated 2 years ago
- A clean implementation of Parsing with Zippers.☆38Sep 22, 2018Updated 7 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Jan 18, 2020Updated 6 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆65Apr 24, 2024Updated last year
- A server for the forester tool☆17Dec 10, 2024Updated last year
- Experimenting on ornamentation in Agda via reflection.☆12Jul 1, 2023Updated 2 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22May 20, 2021Updated 4 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Jul 22, 2021Updated 4 years ago
- higher-kinded data☆30May 16, 2023Updated 2 years ago
- Show programming language printed values in a web UI☆24May 16, 2019Updated 6 years ago
- Generic functions for single-sorted first-order structural unification☆45Updated this week
- Type-Level Programming in Rust☆27Dec 29, 2021Updated 4 years ago