nyuichi / LeanHOLLinks
super tiny implementation of higher-order logic proof assistant in lean
☆22Updated 6 years ago
Alternatives and similar repositories for LeanHOL
Users that are interested in LeanHOL are comparing it to the libraries listed below
Sorting:
- HoTT in Japanese☆36Updated 2 years ago
- Template Haskell Implementation of Egison Pattern Matching☆33Updated 5 years ago
- Minimal Haskell Compiler☆63Updated 7 years ago
- yet another toy OCaml interpreter in Haskell☆12Updated 5 years ago
- Haskell library for non-deterministic pattern matching☆17Updated last week
- A proof tree viewer that works with Coq through Proof General☆28Updated 4 years ago
- ☆36Updated 4 years ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- Stable sort algorithms and their stability proofs in Rocq☆25Updated 2 weeks ago
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Updated 8 years ago
- Deciding Presburger arithmetic in agda☆33Updated 2 years ago
- A Formal Verification of Algorithm W☆17Updated 4 years ago
- Archived since the contents have been moved to the Hydras & Co. repository☆30Updated 3 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 4 years ago
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- Monadic effects and equational reasoning in Rocq☆73Updated last week
- Old Coq plugin for parametricity [maintainer=@ppedrot]☆44Updated last week
- A cyclic theorem prover framework.☆32Updated 4 months ago
- HoTT in Lean 3☆82Updated 5 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆47Updated 5 months ago
- A Unifying Cartesian Cubical Set Model☆35Updated 6 years ago
- A prototypical dependently typed languages with sized types and variances☆115Updated 5 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- Coq formalizations of Sequent Calculus, Natural Deduction, etc. systems for propositional logic☆45Updated 9 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆86Updated 5 years ago
- A cost-aware logical framework, embedded in Agda.☆69Updated last month
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆32Updated 3 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago