Alternatives and similar repositories for Remora

Users that are interested in Remora are comparing it to the libraries listed below

• stchang / macrotypes
  ☆137Updated 3 years ago
• namin / staged-miniKanren
  multi-stage relational programming for staged relational interpreters: running with holes, faster
  ☆135Updated last month
• mmirman / caledon
  higher order dependently typed logic programing
  ☆173Updated 6 years ago
• vmchale / apple
  Apple array system
  ☆67Updated last month
• melted / idris-chez
  An idris backend compiling to chez scheme
  ☆47Updated 7 years ago
• TiarkRompf / collapsing-towers
  Collapsing Towers of Interpreters
  ☆91Updated last month
• clf / celf
  ☆60Updated 6 years ago
• rain-1 / continuations-study-group
  ☆79Updated 6 years ago
• plum-umd / adapton.racket
  Racket-based implementation of Adapton
  ☆22Updated 6 years ago
• kmcallister / qoppa
  Metacircular evaluator for a tiny fexpr language
  ☆44Updated 13 years ago
• wilbowma / cur
  A less devious proof assistant
  ☆225Updated 2 years ago
• acharal / hopes
  Higher Order Prolog with Extensional Semantics
  ☆53Updated 5 years ago
• SMLFamily / The-Mechanization-of-Standard-ML
  The Mechanization of Standard ML
  ☆73Updated 3 years ago
• astampoulis / makam
  The Makam Metalanguage
  ☆198Updated 2 years ago
• John-Nagle / nqthm
  nqthm - the original Boyer-Moore theorem prover, from 1992
  ☆54Updated 8 years ago
• melsman / apltail
  APL Compiler targeting a typed array intermediate language
  ☆216Updated 10 months ago
• michaelballantyne / faster-minikanren
  A fast implementation of miniKanren with disequality and absento, compatible with Racket and Chez.
  ☆158Updated 5 months ago
• asperti / BOHM1.1
  Bologna Optimal Higher-Order Machine, Version 1.1
  ☆74Updated 8 years ago
• axch / dysvunctional-language
  Running the code you want to write as fast as the code you have to write
  ☆140Updated 8 years ago
• mndrix / microkanren-prolog
  Prolog implementation of microKanren
  ☆43Updated 10 years ago
• dvanhorn / redex-aam-tutorial
  An Introduction to Redex with Abstracting Abstract Machines
  ☆103Updated last year
• andrejbauer / marshall
  Real number computation software
  ☆126Updated 2 years ago
• fisherdj / miniAdapton
  a minimal implementation of incremental computation in Scheme
  ☆35Updated 8 years ago
• webyrd / hindley-milner-type-inferencer
  Relational Hindley-Milner type inferencer in miniKanren. Supports polymorphic 'let'. Performs type habitation.
  ☆21Updated 10 years ago
• teyjus / teyjus
  An efficient implementation of the higher-order logic programming language Lambda Prolog
  ☆156Updated last year
• namin / clpsmt-miniKanren
  CLP(SMT) on top of miniKanren
  ☆38Updated 3 years ago
• dedbox / racket-algebraic
  Algebraic structures for untyped Racket
  ☆77Updated last year
• mflatt / expander
  ☆71Updated 4 months ago
• rjnw / sham
  A DSL for runtime code generation in racket
  ☆67Updated 3 years ago
• takikawa / sweet-racket
  A port of sweet expressions to Racket
  ☆48Updated 2 years ago