Alternatives and similar repositories for full-maude

Users that are interested in full-maude are comparing it to the libraries listed below

• maude-team / maude
  This repository contains the Maude 2 interpreter source tree.
  ☆43Updated 7 years ago
• maude-team / MFE
  Maude Formal Environment
  ☆17Updated 5 years ago
• leuschel / logen
  Offline partial evaluation system for Prolog written using the cogen approach
  ☆19Updated 8 years ago
• mrocklin / matrix-algebra
  An algebra for Matrix Expressions written in Maude
  ☆24Updated 12 years ago
• aposwolsky / delphin
  The Delphin Project
  ☆10Updated 8 years ago
• QuickChick / Luck
  Luck -- A Language for Property-Based Generators
  ☆34Updated 3 months ago
• SMLFamily / SML-The-Living-Language
  SML, The Living Language (aka, Successor ML)
  ☆72Updated 9 years ago
• SMLFamily / The-Mechanization-of-Standard-ML
  The Mechanization of Standard ML
  ☆73Updated 2 years ago
• logic-tools / sml-handbook
  SML code for Handbook of Practical Logic and Automated Reasoning - For Isabelle too
  ☆36Updated 8 years ago
• aprolog-lang / aprolog
  αProlog
  ☆17Updated last year
• iambrj / metaKanren
  Relational interpreter for miniKanren, in miniKanren.
  ☆14Updated 3 years ago
• agda / ooAgda
  Interactive and object-oriented programming in Agda using coinductive types
  ☆23Updated 6 months ago
• triska / trs
  Reason about Term Rewriting Systems
  ☆16Updated 2 years ago
• ISANobody / sill
  ☆29Updated 9 years ago
• aldorlang / aldor
  The Aldor Programming Language
  ☆34Updated 3 months ago
• stamourv / partial-evaluation-tutorial
  Racket implementation of Cook and Lämmel's partial evaluation tutorial.
  ☆31Updated 12 years ago
• triska / clpb
  Boolean Constraint Solving in Prolog
  ☆43Updated 5 months ago
• bmsherman / topology
  Formal topology (and some probability) in Coq
  ☆32Updated 6 years ago
• Deducteam / SizeChangeTool
  A termination checker for higher-order rewriting with dependent types
  ☆10Updated 5 years ago
• meta-logic / lltp
  TPTP linear logic version
  ☆13Updated 4 months ago
• ptarau / TypesAndProofs
  Type inference algorithms and intuitionistic propositional theorem provers solving type inhabitation problems
  ☆33Updated last year
• robsimmons / abbot
  Generation of abstract binding trees
  ☆28Updated 7 months ago
• TOTBWF / muprl
  A small NuPRL style proof assistant
  ☆31Updated 6 years ago
• liamoc / hilbert
  An intensely interactive, graphical theorem prover based on natural deduction
  ☆29Updated 10 years ago
• webyrd / curnelo
  Cur dependently-typed language in miniKanren.
  ☆17Updated 7 years ago
• UCSD-PL / nano-smt
  "Toy" SMT Solver for Educational Purposes
  ☆20Updated 12 years ago
• david-christiansen / pudding-old
  A language-integrated proof assistant, for and in Racket
  ☆39Updated 8 years ago
• rowandavies / sml-cidre
  SML Checker for Intersection and Datasort Refinements (pronounced "cider")
  ☆20Updated 11 years ago
• JUrban / MPTP2
  ☆19Updated 8 years ago
• tuura / selective-theory-coq
  Selective applicative functors laws and theorems
  ☆14Updated 5 years ago