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
  ☆33Updated 8 months ago
• jpt4 / skio
  Pure relational SKI combinator calculus interpreter.
  ☆10Updated 7 years ago
• namin / reflective-towers
  software archaeology of reflective towers of interpreters
  ☆15Updated 4 months ago
• fnogatz / dcg4pt
  Extend Definite Clause Grammars for Prolog by the corresponding parse tree
  ☆11Updated 2 years ago
• namin / mk-on-smt
  miniKanren for search, SMT for solving
  ☆13Updated 5 years ago
• mndrix / microkanren-prolog
  Prolog implementation of microKanren
  ☆41Updated 10 years ago
• ptarau / binprolog
  Fast, simplified WAM-based Prolog system
  ☆21Updated last year
• poplog / poplog
  Poplog
  ☆21Updated 14 years ago
• JanWielemaker / ffi
  SWI-Prolog dynamic C interface
  ☆17Updated 4 months ago
• webyrd / alphaKanren
  Nominal logic programming extensions to miniKanren, based on alphaProlog.
  ☆25Updated 11 years ago
• friguzzi / matrix
  Operations with matrices, SWI pack
  ☆13Updated last year
• triska / clpb
  Boolean Constraint Solving in Prolog
  ☆39Updated 2 months ago
• kyledewey / typed-prolog
  A basic type system on top of Prolog, along with higher-order clauses. Translates to normal Prolog.
  ☆28Updated 7 years ago
• FredMesnard / lptp
  LPTP: A Logic Program Theorem Prover, written by Robert F. Staerk in the mid 90's
  ☆10Updated last year
• khayyamsaleem / gradual-typing
  an implementation of gradual typing in mit-scheme
  ☆9Updated 3 years ago
• stamourv / partial-evaluation-tutorial
  Racket implementation of Cook and Lämmel's partial evaluation tutorial.
  ☆31Updated 12 years ago
• MLton / mltonlib
  The MLtonLibrary repository
  ☆35Updated last year
• rntz / minikanren-datalog
  Datalog implemented in minikanren
  ☆24Updated 7 years ago
• namin / blond
  the reflective tower Blond by Olivier Danvy & Karoline Malmkjær
  ☆15Updated last year
• Anniepoo / swiplchrtut
  Tutorial for the CHR system
  ☆16Updated 4 years ago
• webyrd / linear-logic-multiset-rewriting
  Logic for story telling!
  ☆34Updated 6 years ago
• gregr / dbKanren
  Kanren with databases
  ☆43Updated 6 months ago
• axch / rules
  An extensible pattern matching, pattern dispatch, and term rewriting system for MIT Scheme.
  ☆19Updated 11 months ago
• namin / clpsmt-miniKanren
  CLP(SMT) on top of miniKanren
  ☆35Updated 2 years ago
• stchang / mlish
  ☆21Updated 4 years ago
• melvinzhang / maru
  A compiler to IA32 and REPL for maru in maru under 7k s-expressions
  ☆16Updated 4 years ago
• namin / leanTAP
  A Declarative Theorem Prover for First-Order Classical Logic
  ☆28Updated 8 months ago
• Wodan58 / joy1
  Manfred von Thun's Programming Language Joy
  ☆16Updated last month
• dpiponi / SASL
  A simple and educational compiler for the SASL programming language
  ☆23Updated 6 years ago
• theoremprover-museum / prover9
  Prover9 is an automated theorem prover for first-order and equational logic, and Mace4 searches for finite models and counterexamples.
  ☆16Updated 6 years ago