wilbowma / cur
A less devious proof assistant
☆222Updated 2 years ago
Alternatives and similar repositories for cur:
Users that are interested in cur are comparing it to the libraries listed below
- ☆136Updated 2 years ago
- ☆92Updated last week
- higher order dependently typed logic programing☆170Updated 6 years ago
- staged relational interpreters: running with holes, faster☆126Updated 2 months ago
- An efficient implementation of the higher-order logic programming language Lambda Prolog☆152Updated 9 months ago
- The People's Refinement Logic☆228Updated 2 years ago
- an implementation of stuck macros☆136Updated 2 months ago
- A fast implementation of miniKanren with disequality and absento, compatible with Racket and Chez.☆156Updated 6 months ago
- ☆77Updated 5 years ago
- nanopass compiler framework for Racket☆184Updated last year
- Abstracting Definitional Interpreters☆67Updated 7 years ago
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆205Updated 2 years ago
- Charity language interpreters and literature☆114Updated 5 years ago
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆110Updated 5 years ago
- Malfunctional Programming☆343Updated 2 months ago
- Coq formalizations of functional languages.☆141Updated 4 years ago
- ☆59Updated 5 years ago
- An in-memory datalog implementation for OCaml.☆264Updated 3 months ago
- A proof assistant for general type theories☆299Updated 3 months ago
- The Art of the Propagator. See also:☆172Updated 9 months ago
- The Ntha Programming Language☆93Updated 8 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆145Updated 3 years ago
- Convert Haskell source code to Coq source code☆280Updated 4 years ago
- Embeddable Lambda Prolog Interpreter☆298Updated last week
- Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations☆371Updated last year
- Dependently-typed language with Iverson-style implicit lifting☆121Updated 4 years ago
- An implementation of Pie in Haskell☆204Updated 5 years ago
- Koans are small lessons on the path to enlightenment. The aim of the Idris Koans project is to provide an easy learning environment in Id…☆177Updated 6 years ago
- Implementation of the λΠ-calculus modulo rewriting☆201Updated 2 months ago
- Canonical miniKanren implementation in Racket☆84Updated 3 years ago