jrslepak / RemoraLinks
Dependently-typed language with Iverson-style implicit lifting
☆126Updated 5 years ago
Alternatives and similar repositories for Remora
Users that are interested in Remora are comparing it to the libraries listed below
Sorting:
- ☆138Updated 3 years ago
- Apple array system☆67Updated this week
- multi-stage relational programming for staged relational interpreters: running with holes, faster☆136Updated 2 months ago
- ☆79Updated 6 years ago
- Collapsing Towers of Interpreters☆91Updated 2 months ago
- A fast implementation of miniKanren with disequality and absento, compatible with Racket and Chez.☆158Updated 7 months ago
- An idris backend compiling to chez scheme☆48Updated 7 years ago
- The Mechanization of Standard ML☆73Updated 3 years ago
- Metacircular evaluator for a tiny fexpr language☆44Updated 13 years ago
- higher order dependently typed logic programing☆174Updated 7 years ago
- The Makam Metalanguage☆199Updated 2 years ago
- A less devious proof assistant☆226Updated 2 years ago
- APL Compiler targeting a typed array intermediate language☆216Updated last year
- ☆61Updated 6 years ago
- Prolog implementation of microKanren☆43Updated 10 years ago
- Racket-based implementation of Adapton☆22Updated 6 years ago
- Relational Hindley-Milner type inferencer in miniKanren. Supports polymorphic 'let'. Performs type habitation.☆21Updated 10 years ago
- A DSL for runtime code generation in racket☆67Updated 3 years ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆75Updated 8 years ago
- nqthm - the original Boyer-Moore theorem prover, from 1992☆56Updated 9 years ago
- ☆71Updated 6 months ago
- ATS2: Unleashing the Potentials of Types and Templates☆45Updated 5 years ago
- A microKanren framework for implementing constraints.☆18Updated 7 years ago
- Canonical miniKanren implementation in Racket☆86Updated 3 years ago
- Running the code you want to write as fast as the code you have to write☆140Updated 8 years ago
- Statically typed embedding of miniKanren relational programming language into OCaml☆118Updated 2 months ago
- A port of sweet expressions to Racket☆48Updated 2 years ago
- An Introduction to Redex with Abstracting Abstract Machines☆103Updated last year
- Mirror of Epigram 2, by Conor McBride, et al.☆49Updated 5 years ago
- A basic type system on top of Prolog, along with higher-order clauses. Translates to normal Prolog.☆30Updated 7 years ago