Alternatives and similar repositories for plog:

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

• triska / clpb
  Boolean Constraint Solving in Prolog
  ☆40Updated 3 months ago
• 4y8 / ski-in-asm
  A SKI combinators interpreter written in assembly
  ☆19Updated 4 years ago
• jfdm / velo-lang
  Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.
  ☆16Updated last year
• jpt4 / skio
  Pure relational SKI combinator calculus interpreter.
  ☆11Updated 7 years ago
• kyledewey / typed-prolog
  A basic type system on top of Prolog, along with higher-order clauses. Translates to normal Prolog.
  ☆29Updated 7 years ago
• theoremprover-museum / LCF77
  The original Edinburgh LCF.
  ☆23Updated 8 years ago
• xieyuheng / cat
  A categorical semantics library in Agda.
  ☆17Updated 5 years ago
• brismu / brismu
  A relational interpretation of Lojban
  ☆33Updated last month
• mndrix / edcg
  Extended DCG syntax for Prolog by Peter Van Roy
  ☆21Updated 7 years ago
• webyrd / normalization-by-evaluation
  Normalization-by-evaluation in miniKanren
  ☆24Updated 2 years ago
• webyrd / alphaKanren
  Nominal logic programming extensions to miniKanren, based on alphaProlog.
  ☆25Updated 11 years ago
• RichardMoot / LinearOne
  LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.
  ☆18Updated 4 years ago
• sto0pkid / swipl-tt
  Implementation of dependent type theory in SWI-Prolog
  ☆8Updated 4 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆39Updated 4 years ago
• stchang / mlish
  ☆21Updated 5 years ago
• lexi-lambda / mini-ml
  An experimental implementation of a tiny ML-like language using an embedded custom expander (WIP, currently just System F core language)
  ☆21Updated 6 years ago
• meta-logic / lltp
  TPTP linear logic version
  ☆13Updated last month
• webyrd / curnelo
  Cur dependently-typed language in miniKanren.
  ☆17Updated 7 years ago
• VictorTaelin / Elementary-Affine-Core-legacy
  A simple, untyped, terminating functional language that is fully compatible with optimal reductions.
  ☆17Updated 5 years ago
• ptarau / binprolog
  Fast, simplified WAM-based Prolog system
  ☆21Updated 2 years ago
• rootmos / silly-joy
  An interpreter for the concatenative language Joy, written in Haskell using extensible-effects
  ☆35Updated 5 months ago
• michaelballantyne / syntax-spec
  A metalanguage for creating sophisticated DSLs in Racket.
  ☆31Updated last week
• effectfully / Cubes
  A dependently typed type checker for a TT with intervals
  ☆22Updated 5 years ago
• namin / reflective-towers
  software archaeology of reflective towers of interpreters
  ☆15Updated 5 months ago
• gregr / dbKanren
  Kanren with databases
  ☆43Updated 7 months ago
• maxsnew / modal-scheme
  A Scheme-like CBPV language with Racket Interoperability
  ☆39Updated last year
• metareflection / poof
  Prototypes: Object Orientation, Functionally
  ☆43Updated this week
• astump / cedille-core-spec
  Specification of the Cedille Core language
  ☆29Updated 4 years ago
• iambrj / metaKanren
  Relational interpreter for miniKanren, in miniKanren.
  ☆14Updated 3 years ago
• hkust-taco / superf
  Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…
  ☆14Updated 10 months ago