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
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- Template Haskell Implementation of Egison Pattern Matching☆33Updated 5 years ago
- Minimal Haskell Compiler☆63Updated 7 years ago
- Monadic effects and equational reasoning in Rocq☆74Updated last month
- A proof tree viewer that works with Coq through Proof General☆28Updated 5 years ago
- Stable sort algorithms and their stability proofs in Rocq☆25Updated 2 months ago
- ☆38Updated 4 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆87Updated 5 years ago
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- quotient types in cubical Agda☆24Updated 7 years ago
- A Unifying Cartesian Cubical Set Model☆35Updated 6 years ago
- Coq formalizations of Sequent Calculus, Natural Deduction, etc. systems for propositional logic☆45Updated 9 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆49Updated 6 months ago
- HoTT in Lean 3☆81Updated 5 years 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 prototypical dependently typed languages with sized types and variances☆115Updated 3 weeks 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
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 8 years ago
- yet another toy OCaml interpreter in Haskell☆12Updated 5 years ago
- A formalisation of the Calculus of Constructions☆70Updated last year
- Haskell library for non-deterministic pattern matching☆17Updated last month
- A compiler and runtime for normalizing the untyped λ-calculus☆32Updated 4 years ago
- Archived since the contents have been moved to the Hydras & Co. repository☆30Updated 3 years ago
- A Formal Verification of Algorithm W☆17Updated 4 years ago
- ☆84Updated last year
- Inline, type safe X86-64 assembly programming in Agda☆69Updated 7 years ago
- Lean type-checker written in Scala.☆40Updated 3 years ago
- Old Coq plugin for parametricity [maintainer=@ppedrot]☆44Updated last month