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 2 months ago
- An idris backend compiling to chez scheme☆48Updated 8 years ago
- Collapsing Towers of Interpreters☆93Updated 7 months ago
- A less devious proof assistant☆230Updated 3 years ago
- higher order dependently typed logic programing☆173Updated 7 years ago
- ☆64Updated 6 years ago
- Metacircular evaluator for a tiny fexpr language☆44Updated 13 years ago
- Relational Hindley-Milner type inferencer in miniKanren. Supports polymorphic 'let'. Performs type habitation.☆23Updated 10 years ago
- The Mechanization of Standard ML☆75Updated 3 years ago
- Higher Order Prolog with Extensional Semantics☆53Updated 5 years ago
- ☆78Updated 6 years ago
- Apple array system☆69Updated last month
- A fast implementation of miniKanren with disequality and absento, compatible with Racket and Chez.☆167Updated last year
- Prolog implementation of microKanren☆44Updated 10 years ago
- APL Compiler targeting a typed array intermediate language☆217Updated last year
- Logic for story telling!☆36Updated 7 years ago
- nanopass compiler framework for Racket☆200Updated 2 years ago
- nqthm - the original Boyer-Moore theorem prover, from 1992☆57Updated 9 years ago
- Canonical miniKanren implementation in Racket☆87Updated 4 years ago
- A DSL for runtime code generation in racket☆68Updated 3 years ago
- Relational Programming in miniKanren☆52Updated 10 years ago
- The Makam Metalanguage☆199Updated 2 years ago
- Algebraic structures for untyped Racket☆78Updated last year
- Mirror of Epigram 2, by Conor McBride, et al.☆58Updated 5 years ago
- ☆78Updated 11 months ago
- Running the code you want to write as fast as the code you have to write☆140Updated 9 years ago
- An Introduction to Redex with Abstracting Abstract Machines☆104Updated last year
- A port of sweet expressions to Racket☆49Updated 2 years ago
- A small implementation of type inference☆80Updated 10 years ago