A simple λProlog interpreter
☆20Nov 29, 2021Updated 4 years ago
Alternatives and similar repositories for simple-lambda-prolog
Users that are interested in simple-lambda-prolog are comparing it to the libraries listed below
Sorting:
- A simple prolog implementation in Rust☆26Nov 14, 2020Updated 5 years ago
- Inefficient and syntactically unwieldy implementation of algebraic effects in Python using generators☆13Aug 31, 2020Updated 5 years ago
- ☆13Nov 23, 2019Updated 6 years ago
- A SKI combinators interpreter written in assembly☆20Jul 25, 2020Updated 5 years ago
- Multinomials for the Mathematical Components library.☆16Nov 7, 2025Updated 3 months ago
- A simple BDD library for OCaml☆13May 20, 2025Updated 9 months ago
- Mechanized Theory of Event Structures☆16Aug 16, 2023Updated 2 years ago
- A parser based on the ALL(*) algorithm, implemented and verified in Coq.☆13Feb 14, 2023Updated 3 years ago
- A verified Implementation of a mini prolog☆17Nov 27, 2022Updated 3 years ago
- IDE support for the functional logic programming language Curry☆35Oct 23, 2025Updated 4 months ago
- A minimal example of a formally verified parser using ocamllex and Menhir's Coq backend.☆21Mar 19, 2015Updated 10 years ago
- Interpreter for functional pure type systems.☆21Jun 30, 2017Updated 8 years ago
- The compiler for N⋆, a statically typed assembly language used as a compiler backend for Zilch☆31May 27, 2023Updated 2 years ago
- A WIP compiler for a functional language. Very incomplete!☆16Nov 6, 2021Updated 4 years ago
- A Coq tactic for proving multivariate inequalities using SDP solvers☆12Feb 3, 2026Updated 3 weeks ago
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆20Nov 12, 2020Updated 5 years ago
- A MinCaml compiler implemented in Rust☆44Updated this week
- An OCaml library implementing unifiable abstract binding trees (UABTs)☆28Nov 11, 2023Updated 2 years ago
- Digital art☆10May 12, 2020Updated 5 years ago
- an experiment in presenting code.☆14Aug 11, 2020Updated 5 years ago
- An implementation of Colin James' "Compiling Lambda Calculus"☆16Sep 29, 2022Updated 3 years ago
- Any resemblance to real and actual mails is purely coincidental.☆12Sep 23, 2021Updated 4 years ago
- An esoteric language based on overlapping tree-like structures☆10Oct 16, 2021Updated 4 years ago
- A non-interactive proof assistant using the Haskell type system☆38Apr 11, 2020Updated 5 years ago
- Reflective PHOAS rewriting/pattern-matching-compilation framework for simply-typed equalities and let-lifting☆26Feb 17, 2026Updated last week
- Like the Programming Languages Zoo but with esoteric languages.☆25May 22, 2020Updated 5 years ago
- Duo - A research language exploring duality in programming language design☆61May 23, 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
- A mini language for logic programming☆23Jun 5, 2020Updated 5 years ago
- the reflective tower Blond by Olivier Danvy & Karoline Malmkjær☆16May 21, 2025Updated 9 months ago
- A cute Gemini client written in OCaml☆16Nov 5, 2022Updated 3 years ago
- Zippers for cofree types☆14Dec 7, 2021Updated 4 years ago
- An interval library for OCaml☆16Dec 9, 2022Updated 3 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Apr 18, 2018Updated 7 years ago
- 🌳 Generate a fresh bonsai in your terminal☆31Oct 4, 2021Updated 4 years ago
- Design, play with, and analyze sequent calculus proof systems.☆14Sep 5, 2024Updated last year
- Fast vectorized bitarrays for OCaml☆16Jul 11, 2023Updated 2 years ago
- A Coq plugin that implements exceptions in Coq☆13Jan 7, 2021Updated 5 years ago
- A fornalisation of Grobner basis in ssreflect☆12Jan 29, 2026Updated last month