Alternatives and similar repositories for pads

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

• padsproj / pads-haskell
  Haskell binding for PADS
  ☆19Updated 6 years ago
• boomerang-lang / boomerang
  The Boomerang Bidirectional Programming Language
  ☆77Updated 2 years ago
• ptarau / TypesAndProofs
  Type inference algorithms and intuitionistic propositional theorem provers solving type inhabitation problems
  ☆33Updated last year
• cesaro / cunf
  A model checker for safe Petri nets based on partial-order semantics
  ☆13Updated 4 years ago
• standardml / parcom
  SML Parser Combinator Library
  ☆28Updated 9 years ago
• rewriting / tom
  ☆34Updated 4 years ago
• aryx / syncweb
  literate programming meets unison
  ☆28Updated this week
• maude-team / full-maude
  Automatically exported from code.google.com/p/full-maude
  ☆16Updated last year
• gilith / opentheory
  The opentheory tool processes higher order logic theory packages
  ☆16Updated 2 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
• Pascal-J / type-system-j
  adds an optional type system to J language
  ☆21Updated 9 years ago
• mndrix / microkanren-prolog
  Prolog implementation of microKanren
  ☆43Updated 10 years ago
• theoremprover-museum / LCF77
  The original Edinburgh LCF.
  ☆32Updated 8 years ago
• triska / trs
  Reason about Term Rewriting Systems
  ☆16Updated 2 years ago
• aposwolsky / delphin
  The Delphin Project
  ☆10Updated 8 years ago
• leuschel / logen
  Offline partial evaluation system for Prolog written using the cogen approach
  ☆19Updated 8 years ago
• fnogatz / dcg4pt
  Extend Definite Clause Grammars for Prolog by the corresponding parse tree
  ☆11Updated 2 years ago
• aprolog-lang / aprolog
  αProlog
  ☆18Updated last year
• logic-tools / nadea
  NaDeA (Natural Deduction Assistant) - With a Formalization in Isabelle
  ☆16Updated 2 years ago
• theoremprover-museum / HOL88
  The HOL System is an environment for interactive theorem proving in a higher-order logic. Its most outstanding feature is its high degre…
  ☆10Updated 8 years ago
• nathanielrb / ftmicroKanren
  First-order temporal logic programming with microKanren
  ☆18Updated 7 years ago
• rntz / minikanren-datalog
  Datalog implemented in minikanren
  ☆24Updated 7 years ago
• maude-team / MFE
  Maude Formal Environment
  ☆17Updated 5 years ago
• acharal / hopes
  Higher Order Prolog with Extensional Semantics
  ☆53Updated 4 years ago
• kach / recreational-rosette
  Some fun examples of solving problems with symbolic execution
  ☆114Updated 6 years ago
• MLton / mltonlib
  The MLtonLibrary repository
  ☆36Updated 2 years ago
• mndrix / func
  Apply and compose functions in Prolog
  ☆19Updated 8 years ago
• GavinMendelGleason / mavis
  Optional types for Prolog
  ☆16Updated 5 years ago
• mndrix / edcg
  Extended DCG syntax for Prolog by Peter Van Roy
  ☆21Updated 7 years ago
• namin / lms-black
  purple: compiling a reflective language
  ☆32Updated 8 months ago