jvranish / MiniKanrenTLinks
An implementation of miniKanren in Haskell
☆79Updated 12 years ago
Alternatives and similar repositories for MiniKanrenT
Users that are interested in MiniKanrenT are comparing it to the libraries listed below
Sorting:
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- GRIN backend for Idris☆50Updated 5 years ago
- Recursion schemes for Idris☆64Updated 7 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆128Updated last year
- Agda-style equational reasoning in Haskell☆54Updated 8 months ago
- Forward-propagating Constraint Solver monad. Good for solving Sudoku, N-Queens, etc.☆67Updated 3 years ago
- The Prettiest Printer☆35Updated last year
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 8 years ago
- A general purpose programming language with linear types☆43Updated 8 years ago
- A monadic approach to static analysis following the methodology of AAM☆18Updated 10 years ago
- Compositional type checking for Haskell☆38Updated 14 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆55Updated 8 years ago
- Codo notation for programming with comonads in Haskell☆25Updated 4 years ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- Tactic Metaprogramming in Haskell☆56Updated 6 years ago
- Provides a type-safe way of working with permutations in Idris☆37Updated 4 years ago
- Type Safe LLVM IR ( Experimental )☆49Updated 7 years ago
- Haskell library for simple, concise and fast generic operations.☆82Updated 2 years ago
- Elaborate and expressive S-Expression library for Haskell☆65Updated last year
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆37Updated 5 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Generic functions for single-sorted first-order structural unification☆45Updated 8 months ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- SPJ's tutorial on implementing functional languages☆29Updated 6 years ago
- ⛏️ A refinement proof framework for haskell☆70Updated 2 years ago
- being some experiments, working towards some equipment I wish I had☆37Updated 9 years ago
- Generic random generators☆81Updated 2 years ago
- The Helium compiler, Helium-as-a-library, and the texthint interpreter☆98Updated last year