Alternatives and similar repositories for LeanHOL:

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

• uemurax / hott-ja
  HoTT in Japanese
  ☆33Updated last year
• egison / egison-haskell
  Template Haskell Implementation of Egison Pattern Matching
  ☆32Updated 4 years ago
• favonia / hdtt2020-notes
  ☆36Updated 3 years ago
• egison / sweet-egison
  Haskell library for non-deterministic pattern matching
  ☆17Updated 3 years ago
• YouyouCong / type-preserving-cps
  Type-preserving CPS translation for simply- and dependently-typed lambda calculi
  ☆19Updated 7 years ago
• ksrky / Plato
  A purely functional programming language based on higher-order polymorphic lambda calculus
  ☆20Updated last year
• pandaman64 / lean-regex
  ☆24Updated last week
• jonsterling / agda-calf
  A cost-aware logical framework, embedded in Agda.
  ☆60Updated 6 months ago
• coq-community / parseque
  Total Parser Combinators in Coq [maintainer=@womeier]
  ☆42Updated last year
• momohatt / hscaml
  yet another toy OCaml interpreter in Haskell
  ☆12Updated 4 years ago
• coq-community / goedel
  Archived since the contents have been moved to the Hydras & Co. repository
  ☆28Updated 2 years ago
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆34Updated last year
• cyclist-org / cyclist
  A cyclic theorem prover framework.
  ☆31Updated last week
• elpinal / seqmod
  Full implementation of F-ing Modules, with the power of sequent calculus
  ☆20Updated 3 years ago
• lotz84 / recursion-algorithms
  a collection of various algorithms written using recursion schemes
  ☆21Updated 3 years ago
• gebner / hott3
  HoTT in Lean 3
  ☆78Updated 4 years ago
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆34Updated 5 years ago
• hide-kawabata / traf
  A proof tree viewer that works with Coq through Proof General
  ☆24Updated 4 years ago
• pi8027 / stablesort
  Stable sort algorithms and their stability proofs in Coq
  ☆22Updated this week
• nomeata / lean-wf-induct
  ☆17Updated 11 months ago
• pi8027 / lambda-calculus
  A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2
  ☆79Updated 4 years ago
• gallais / agda-presburger
  Deciding Presburger arithmetic in agda
  ☆31Updated last year
• elpinal / modules
  Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules
  ☆31Updated 2 years ago
• tchajed / coq-io
  Modeling I/O in Coq using free monads
  ☆10Updated 6 years ago
• kino3 / Mini-TT
  mirror of A simple type-theoretic language: Mini-TT
  ☆38Updated 8 years ago
• bbentzen / mpl
  A Henkin-style completeness proof for the modal logic S5
  ☆13Updated 3 years ago
• fetburner / type-infer
  A Formal Verification of Algorithm W
  ☆17Updated 3 years ago
• ksrky / type-inference
  Type inference algorithms for functional programming languages
  ☆10Updated last year
• konn / herbrand
  An experiment around automated theorem proving in Haskell
  ☆11Updated 2 months ago
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆31Updated 3 years ago