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
- multi-stage relational programming for staged relational interpreters: running with holes, faster☆139Updated last month
- ☆78Updated 6 years ago
- An idris backend compiling to chez scheme☆48Updated 8 years ago
- Collapsing Towers of Interpreters☆93Updated 6 months ago
- A less devious proof assistant☆227Updated 2 years ago
- ☆62Updated 6 years ago
- Apple array system☆68Updated last week
- A fast implementation of miniKanren with disequality and absento, compatible with Racket and Chez.☆166Updated 11 months ago
- ☆75Updated 10 months ago
- APL Compiler targeting a typed array intermediate language☆216Updated last year
- The Makam Metalanguage☆198Updated 2 years ago
- nanopass compiler framework for Racket☆196Updated last year
- Metacircular evaluator for a tiny fexpr language☆44Updated 13 years ago
- The Mechanization of Standard ML☆74Updated 3 years ago
- A DSL for runtime code generation in racket☆68Updated 3 years ago
- Prolog implementation of microKanren☆44Updated 10 years ago
- Racket-based implementation of Adapton☆24Updated 6 years ago
- A port of sweet expressions to Racket☆49Updated 2 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆57Updated 5 years ago
- An efficient implementation of the higher-order logic programming language Lambda Prolog☆160Updated last year
- higher order dependently typed logic programing☆173Updated 7 years ago
- An Introduction to Redex with Abstracting Abstract Machines☆104Updated last year
- Algebraic structures for untyped Racket☆78Updated last year
- Interpreter for the reversible functional language rFun☆38Updated 7 years ago
- Canonical miniKanren implementation in Racket☆87Updated 4 years ago
- nqthm - the original Boyer-Moore theorem prover, from 1992☆56Updated 9 years ago
- Higher Order Prolog with Extensional Semantics☆53Updated 5 years ago
- Relational Hindley-Milner type inferencer in miniKanren. Supports polymorphic 'let'. Performs type habitation.☆22Updated 10 years ago
- Running the code you want to write as fast as the code you have to write☆140Updated 9 years ago