Alternatives and similar repositories for polya:

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

• bzhan / holpy
  Implementation of higher-order logic in Python
  ☆64Updated 2 years ago
• math-comp / Coq-Combi
  Algebraic Combinatorics in Coq
  ☆38Updated 3 months ago
• peterlefanulumsdaine / general-type-theories
  A (formalised) general definition of type theories
  ☆57Updated 3 years ago
• gebner / hott3
  HoTT in Lean 3
  ☆79Updated 4 years ago
• avigad / boole
  The Boole Interactive Reasoning Assistant
  ☆27Updated 10 years ago
• GaloisInc / lean-protocol-support
  This project contains various supporting libraries for lean to reason about protocols.
  ☆43Updated 7 years ago
• verse-lab / lean-ssr
  LeanSSR: an SSReflect-Like Tactic Language for Lean
  ☆35Updated last month
• vrahli / NuprlInCoq
  Implementation of Nuprl's type theory in Coq
  ☆45Updated 4 months ago
• uds-psl / coq-library-complexity
  ☆31Updated last year
• gilith / opentheory
  The opentheory tool processes higher order logic theory packages
  ☆16Updated 2 years ago
• b-mehta / combinatorics
  ☆23Updated 2 years ago
• jtassarotti / coq-proba
  A Probability Theory Library for the Coq Theorem Prover
  ☆54Updated last year
• rwbarton / advent-of-lean-4
  Advent of Code 2020 solutions in Lean 4
  ☆26Updated 4 years ago
• EdAyers / Robotone
  The 'Robot' theorem prover. Fork of github.com/mg262/research
  ☆12Updated 4 years ago
• Coq-Polyhedra / Coq-Polyhedra
  Formalizing convex polyhedra in Coq
  ☆24Updated 9 months ago
• rocq-community / coqeal
  The Coq Effective Algebra Library [maintainers=@CohenCyril,@proux01]
  ☆70Updated last month
• ramonfmir / lean-scheme
  Schemes in Lean (v2)
  ☆43Updated 4 years ago
• bzhan / auto2
  A best-first-search theorem prover implemented in Isabelle
  ☆34Updated 2 years ago
• cmu-phil / Spectral
  ☆46Updated last year
• imdea-software / fcsl-pcm
  Partial Commutative Monoids
  ☆28Updated 2 weeks ago
• avigad / arwm
  Automated Reasoning for the Working Mathematician
  ☆11Updated 5 years ago
• andrejbauer / alg
  Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.
  ☆85Updated 4 years ago
• peterlefanulumsdaine / palmgren-archive
  Research material of Erik Palmgren (1963–2019)
  ☆20Updated 2 weeks ago
• nick8325 / twee
  An equational theorem prover based on Knuth-Bendix completion
  ☆50Updated 3 weeks ago
• paulaneeley / modal
  ☆14Updated 4 years ago
• rocq-community / topology
  General topology in Coq [maintainers=@amiloradovsky,@Columbus240,@stop-cran]
  ☆47Updated 6 months ago
• rfindler / 395-2013
  ☆14Updated 6 years ago
• leuschel / logen
  Offline partial evaluation system for Prolog written using the cogen approach
  ☆19Updated 8 years ago
• math-comp / Abel
  A proof of Abel-Ruffini theorem.
  ☆29Updated last month
• math-comp / odd-order
  The formal proof of the Odd Order Theorem
  ☆30Updated last week