Alternatives and similar repositories for trs

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

• ptarau / TypesAndProofs
  Type inference algorithms and intuitionistic propositional theorem provers solving type inhabitation problems
  ☆34Updated last week
• henrikurms / tail2futhark
  ☆19Updated 7 years ago
• triska / presprover
  Prove formulas of Presburger Arithmetic
  ☆11Updated last year
• aprolog-lang / aprolog
  αProlog
  ☆18Updated 2 years ago
• jpt4 / skio
  Pure relational SKI combinator calculus interpreter.
  ☆11Updated 8 years ago
• namin / reflective-towers
  software archaeology of reflective towers of interpreters
  ☆16Updated 8 months ago
• mndrix / microkanren-prolog
  Prolog implementation of microKanren
  ☆44Updated 10 years ago
• namin / mk-on-smt
  miniKanren for search, SMT for solving
  ☆13Updated 6 years ago
• webyrd / alphaKanren
  Nominal logic programming extensions to miniKanren, based on alphaProlog.
  ☆26Updated 12 years ago
• dpiponi / SASL
  A simple and educational compiler for the SASL programming language
  ☆23Updated 7 years ago
• namin / blond
  the reflective tower Blond by Olivier Danvy & Karoline Malmkjær
  ☆16Updated 8 months ago
• namin / clpsmt-miniKanren
  CLP(SMT) on top of miniKanren
  ☆39Updated 3 years ago
• kyledewey / typed-prolog
  A basic type system on top of Prolog, along with higher-order clauses. Translates to normal Prolog.
  ☆31Updated 8 years ago
• webyrd / normalization-by-evaluation
  Normalization-by-evaluation in miniKanren
  ☆25Updated 2 years ago
• michaelballantyne / syntax-spec
  A metalanguage for creating sophisticated DSLs in Racket.
  ☆39Updated 3 months ago
• rntz / minikanren-datalog
  Datalog implemented in minikanren
  ☆24Updated 8 years ago
• leuschel / logen
  Offline partial evaluation system for Prolog written using the cogen approach
  ☆21Updated 9 years ago
• webyrd / tree-automata
  Tree-automata-based run-time type constraints for miniKanren
  ☆14Updated 2 years ago
• namin / leanTAP
  A Declarative Theorem Prover for First-Order Classical Logic
  ☆28Updated last year
• michaelballantyne / meta-minikanren
  A miniKanren interpreter... in miniKanren. Relationally run your relations relationally!
  ☆24Updated 9 years ago
• rocketnia / fexpress
  A compilation-friendly fexpr language. (Proof of concept.)
  ☆23Updated 5 months ago
• webyrd / hindley-milner-type-inferencer
  Relational Hindley-Milner type inferencer in miniKanren. Supports polymorphic 'let'. Performs type habitation.
  ☆23Updated 10 years ago
• orchid-hybrid / minimips
  minikanren mips assembler/disassembler
  ☆34Updated 10 years ago
• melted / idris-chez
  An idris backend compiling to chez scheme
  ☆48Updated 8 years ago
• SMLFamily / The-Mechanization-of-Standard-ML
  The Mechanization of Standard ML
  ☆75Updated 3 years ago
• ptarau / binprolog
  Fast, simplified WAM-based Prolog system
  ☆25Updated 3 months ago
• ghosthamlet / ann.apl
  Simple Neural Network Examples in 8 lines APL
  ☆32Updated 2 years ago
• mndrix / edcg
  Extended DCG syntax for Prolog by Peter Van Roy
  ☆21Updated 7 years ago
• webyrd / linear-logic-multiset-rewriting
  Logic for story telling!
  ☆36Updated 7 years ago
• mietek / epigram2
  Mirror of Epigram 2, by Conor McBride, et al.
  ☆58Updated 5 years ago