Alternatives and similar repositories for fasill

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

• kyledewey / typed-prolog
  A basic type system on top of Prolog, along with higher-order clauses. Translates to normal Prolog.
  ☆29Updated 7 years ago
• namin / lms-black
  purple: compiling a reflective language
  ☆33Updated 9 months ago
• gregr / dbKanren
  Kanren with databases
  ☆44Updated last year
• rntz / minikanren-datalog
  Datalog implemented in minikanren
  ☆24Updated 7 years ago
• namin / clpsmt-miniKanren
  CLP(SMT) on top of miniKanren
  ☆38Updated 3 years ago
• Barry-Jay / bondi
  source code for the bondi programming language
  ☆40Updated 6 years ago
• mndrix / func
  Apply and compose functions in Prolog
  ☆19Updated 8 years ago
• ptarau / natlog
  Lightweight Prolog-like system designed to smoothly interoperate with deep learning tools
  ☆29Updated last month
• clf / lollimon
  Lollimon, a monadic concurrent linear logic programming language
  ☆28Updated 13 years ago
• stamourv / partial-evaluation-tutorial
  Racket implementation of Cook and Lämmel's partial evaluation tutorial.
  ☆31Updated 13 years ago
• webyrd / linear-logic-multiset-rewriting
  Logic for story telling!
  ☆34Updated 7 years ago
• namin / mk-on-smt
  miniKanren for search, SMT for solving
  ☆13Updated 5 years ago
• webyrd / curnelo
  Cur dependently-typed language in miniKanren.
  ☆17Updated 7 years ago
• mndrix / jolog
  Concurrent and distributed Prolog via join patterns (join calculus)
  ☆12Updated 10 years ago
• webyrd / alphaKanren
  Nominal logic programming extensions to miniKanren, based on alphaProlog.
  ☆25Updated 11 years ago
• triska / trs
  Reason about Term Rewriting Systems
  ☆16Updated 3 years ago
• namin / leanTAP
  A Declarative Theorem Prover for First-Order Classical Logic
  ☆28Updated last year
• mndrix / microkanren-prolog
  Prolog implementation of microKanren
  ☆43Updated 10 years ago
• Sintrastes / Montague
  A library for non-deterministically parsing natural language expressions into a structured form.
  ☆17Updated 2 years ago
• ptarau / TypesAndProofs
  Type inference algorithms and intuitionistic propositional theorem provers solving type inhabitation problems
  ☆33Updated last year
• robertkleffner / CaKe
  An interpreter for a minimal but Turing-complete stack based 'concatenative' language.
  ☆19Updated 11 years ago
• xuexue / neuralkanren
  Neural Guided Constraint Logic Programming for Program Synthesis
  ☆93Updated 6 years ago
• lamdu / lamdu-calculus
  An extended typed Lambda Calculus
  ☆21Updated last year
• philzook58 / rel
  Explorations in relations and the algebra of programming
  ☆17Updated 5 years ago
• clf / celf
  ☆60Updated 6 years ago
• namin / metamk
  Prolog-Style Meta-Interpreters in miniKanren
  ☆33Updated 5 months ago
• prologbyexample / code
  ☆30Updated 2 years ago
• webyrd / normalization-by-evaluation
  Normalization-by-evaluation in miniKanren
  ☆24Updated 2 years ago
• trith / trith
  A concatenative programming language founded on the unholy trinity of Forth, Lisp and RDF triples.
  ☆70Updated 14 years ago
• pnwamk / stop2015-redex
  PLT Redex model of basic Dependently Typed Racket calculus
  ☆18Updated 10 years ago