Alternatives and similar repositories for polya-enumeration-theorem

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

• marcusrossel / verified-compiler
  A toy example of a verified compiler.
  ☆31Updated last week
• vihdzp / rubik-lean4
  Lean 4 formalization of Rubik's cubes
  ☆32Updated 11 months ago
• 658060 / topos
  Topos theory in Lean 4
  ☆16Updated last year
• dwrensha / lean4-maze
  maze game encoded in Lean 4 syntax
  ☆68Updated 7 months ago
• hargoniX / pfmt
  A basic Lean implementation of https://arxiv.org/pdf/2310.01530.pdf
  ☆15Updated 10 months ago
• ionathanch / TTBFL
  A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.
  ☆22Updated 2 weeks ago
• nomeata / lean-calcify
  ☆33Updated 7 months ago
• FormalizedFormalLogic / Arithmetization
  Formalization of Arithmetization of Mathematics/Metamathematics
  ☆13Updated 11 months ago
• leanprover / functional_programming_in_lean
  A book about functional programming in Lean
  ☆45Updated 2 years ago
• tydeu / lean4-partax
  Lean 4 library of tools for parsing and compiling syntax and parser definitions.
  ☆16Updated 2 years ago
• iwilare / church-rosser
  A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…
  ☆29Updated 3 years ago
• rzk-lang / sHoTT
  Formalisations for simplicial HoTT and synthetic ∞-categories.
  ☆57Updated this week
• siddhartha-gadgil / Saturn
  Experiments with SAT solvers with proofs in Lean 4
  ☆63Updated last year
• sgraf812 / mpl
  A prototype for a monadic program logic in Lean that has since been upstreamed into the Lean 4 repo
  ☆37Updated 7 months ago
• uds-psl / coq-library-complexity
  ☆34Updated 2 years ago
• bbentzen / mpl
  A Henkin-style completeness proof for the modal logic S5
  ☆17Updated 4 years ago
• 0art0 / lean-slides
  A tool to auto-generate and render slides from Markdown comments in the Lean editor.
  ☆24Updated 3 weeks ago
• medovina / natty
  Natty is a natural-language proof assistant with an embedded automatic prover for higher-order logic. It is in an early stage of develop…
  ☆38Updated this week
• dwrensha / Chess.lean
  Chess in Lean 4
  ☆29Updated 3 months ago
• crabbo-rave / Soup
  Extra and extended datatypes for Lean 4
  ☆12Updated 3 years ago
• verse-lab / lean-ssr
  LeanSSR: an SSReflect-Like Tactic Language for Lean
  ☆42Updated 2 months ago
• mvr / tiny
  A type theory for tiny objects
  ☆19Updated 2 years ago
• rocq-community / trocq
  A modular parametricity plugin for proof transfer in Coq [maintainers=@CohenCyril,@ecranceMERCE,@amahboubi,@lweqx,@MysaaJava]
  ☆27Updated 3 weeks ago
• vihdzp / combinatorial-games
  Combinatorial game library in Lean 4
  ☆56Updated last week
• calcu16 / lean_complexity
  Complexity analysis in Lean
  ☆10Updated 2 years ago
• rwbarton / advent-of-lean-4
  Advent of Code 2020 solutions in Lean 4
  ☆27Updated 5 years ago
• UnivalencePrinciple / 2LTT-Agda
  Formalization of 2LTT in Agda
  ☆17Updated 6 months ago
• coq-tactician / coq-tactician
  A Seamless, Interactive Tactic Learner and Prover for Coq
  ☆82Updated last week
• rzk-lang / hottbook
  HoTT Book formalisations in Rzk.
  ☆20Updated 2 years ago
• leanprover-community / con-nf
  A formal consistency proof of Quine's set theory New Foundations
  ☆79Updated 7 months ago