Alternatives and similar repositories for maude-bindings:

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

• EngineeringSoftware / roosterize
  Tool for suggesting lemma names in Coq verification projects
  ☆19Updated 2 years ago
• leuschel / logen
  Offline partial evaluation system for Prolog written using the cogen approach
  ☆19Updated 8 years ago
• maude-team / full-maude
  Automatically exported from code.google.com/p/full-maude
  ☆15Updated last year
• lorisdanto / automatark
  Benchmark problems for different models of automata, transducers, and related logics
  ☆28Updated 5 months ago
• JUrban / MPTP2
  ☆19Updated 8 years ago
• mgrabovsky / fm-notes
  Unassorted scribbles on formal methods, type theory, category theory, and so on, and so on
  ☆21Updated last year
• LS-Lab / KeYmaeraX-release
  KeYmaera X: An aXiomatic Tactical Theorem Prover for Hybrid Systems (release)
  ☆79Updated 3 weeks ago
• rocq-community / alea
  Coq library for reasoning on randomized algorithms [maintainers=@anton-trunov,@volodeyka]
  ☆25Updated 3 years ago
• ptarau / pypro
  Lightweight Prolog-like Interpreter and nested tuple store for unification-based tuple mining in Python
  ☆20Updated 2 years ago
• imdea-software / fcsl-pcm
  Partial Commutative Monoids
  ☆28Updated 2 months ago
• isabelle-utp / utp-main
  An implementation of Hoare and He's Unifying Theories of Programming in Isabelle
  ☆35Updated last year
• eprover / PyRes
  Pedagogical first-order prover in Python
  ☆75Updated last month
• Kha / do-supplement
  Supplement of the ICFP'22 paper "‘do’ Unchained: Embracing Local Imperativity in a Purely Functional Language"
  ☆13Updated last month
• IBM / FormalML
  Formalization of Machine Learning Theory with Applications to Program Synthesis
  ☆76Updated 2 months ago
• utwente-fmt / ltsmin
  The LTSmin model checking toolset
  ☆57Updated 4 months ago
• ultimate-pa / smtinterpol
  SMTInterpol interpolating SMT solver
  ☆63Updated last month
• avigad / polya
  A heuristic procedure for proving inequalities
  ☆33Updated 6 years ago
• reactive-systems / bosy
  BoSy is a reactive synthesis tool based on constraint-solving
  ☆19Updated last year
• uuverifiers / tricera
  TriCera: a model checker for C programs
  ☆24Updated last week
• mit-plv / rewriter
  Reflective PHOAS rewriting/pattern-matching-compilation framework for simply-typed equalities and let-lifting
  ☆22Updated 2 weeks ago
• friguzzi / bddem
  bddem is a SWI-Prolog pack for using Binary Decision Diagrams
  ☆11Updated last year
• siddhartha-gadgil / lean-loris
  Experiments with some ways of automating reasoning in lean 4
  ☆15Updated 11 months ago
• namin / holey
  Python library for program synthesis and symbolic execution combining constraint solving and LLMs
  ☆15Updated this week
• cs-au-dk / MONA
  MONA - a decision procedure for monadic second-order logic on finite strings and trees
  ☆49Updated 5 years ago
• kframework / matching-logic-prover
  ☆15Updated 3 years ago
• CertiGraph / CertiGraph
  A library for verifying graph-manipulating programs. Powered by Coq and VST. Compatible with CompCert.
  ☆18Updated last month
• VERIMAG-Polyhedra / VPL
  Verimag Polyhedra Library
  ☆17Updated 4 years ago
• logsem / clutch
  Probabilistic separation logics for verifying higher-order probabilistic programs.
  ☆21Updated this week
• leoprover / Leo-III
  An Automated Theorem Prover for Classical Higher-Order Logic with Henkin Semantics
  ☆45Updated last month
• avigad / arwm
  Automated Reasoning for the Working Mathematician
  ☆11Updated 5 years ago