Alternatives and similar repositories for lptp

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

• ptarau / TypesAndProofs
  Type inference algorithms and intuitionistic propositional theorem provers solving type inhabitation problems
  ☆34Updated 2 weeks ago
• mndrix / edcg
  Extended DCG syntax for Prolog by Peter Van Roy
  ☆21Updated 7 years ago
• leuschel / logen
  Offline partial evaluation system for Prolog written using the cogen approach
  ☆20Updated 9 years ago
• triska / clpb
  Boolean Constraint Solving in Prolog
  ☆48Updated 11 months ago
• triska / trs
  Reason about Term Rewriting Systems
  ☆18Updated 3 years ago
• ridgeworks / clpBNR
  CLP(BNR) module for SWI-Prolog
  ☆44Updated 6 months ago
• aprolog-lang / aprolog
  αProlog
  ☆18Updated 2 years ago
• mndrix / microkanren-prolog
  Prolog implementation of microKanren
  ☆43Updated 10 years ago
• vscosta / yap
  ☆60Updated this week
• nicoabie / quickcheck
  Randomized testing for Prolog à la QuickCheck
  ☆23Updated 6 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
• Anniepoo / swiplchrtut
  Tutorial for the CHR system
  ☆16Updated 4 years ago
• ptarau / binprolog
  Fast, simplified WAM-based Prolog system
  ☆25Updated 2 weeks ago
• ReedOei / Pecan
  An automated theorem prover that uses Büchi automata.
  ☆43Updated 4 years ago
• SWI-Prolog / packages-chr
  CHR: Leuven Constraint Handling Rules
  ☆26Updated last week
• AdaCore / sparkformal
  The project SPARK Formal aims at developing a complete semantics of the SPARK language in Coq.
  ☆12Updated 4 years ago
• shwestrick / smlfmt
  A custom parser/auto-formatter for Standard ML
  ☆83Updated 2 months ago
• nfzhou / lp-contest
  ☆11Updated last month
• harp-lab / slog-lang1
  Slog 1.0
  ☆45Updated last year
• SMLFamily / The-Mechanization-of-Standard-ML
  The Mechanization of Standard ML
  ☆74Updated 3 years ago
• teyjus / teyjus
  An efficient implementation of the higher-order logic programming language Lambda Prolog
  ☆157Updated last year
• maude-lang / Maude
  Language based on Rewriting Logic
  ☆143Updated last month
• avigad / polya
  A heuristic procedure for proving inequalities
  ☆34Updated 7 years ago
• ncihnegn / miranda
  Miranda is a pure, non-strict, polymorphic, higher order functional programming language designed by David Turner in 1983-6. https://code…
  ☆60Updated 5 months ago
• AdaCore / why3
  SPARK 2014 repository for the Why3 verification platform.
  ☆33Updated last week
• cognitive-engineering-lab / document-calculus
  Accompanying materials for "A Core Calculus for Documents"
  ☆35Updated 2 years ago
• bzhan / holpy
  Implementation of higher-order logic in Python
  ☆65Updated 2 years ago
• mndrix / prolog_library_ideas
  Random ideas about libraries for Prolog
  ☆12Updated 9 years ago
• webyrd / alphaKanren
  Nominal logic programming extensions to miniKanren, based on alphaProlog.
  ☆25Updated 11 years ago
• SWI-Prolog / sCASP
  Top-down interpreter for ASP programs with Constraints
  ☆34Updated 4 months ago