CakeML / candleLinks
The Candle theorem prover (fork of the HOL Light sources)
☆15Updated last year
Alternatives and similar repositories for candle
Users that are interested in candle are comparing it to the libraries listed below
Sorting:
- General topology in Coq [maintainers=@amiloradovsky,@Columbus240,@stop-cran]☆51Updated last year
- A verified compiler for a lazy functional language☆37Updated 2 weeks ago
- Gallina to Bedrock2 compilation toolkit☆64Updated this week
- An enhanced unification algorithm for Coq☆58Updated 6 months ago
- ☆56Updated 2 weeks ago
- Implementation of Nuprl's type theory in Coq☆46Updated 11 months ago
- Hoare Type Theory☆83Updated 4 months ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 2 months ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- An interactive theorem prover based on lambda-tree syntax☆98Updated last month
- ☆84Updated 8 years ago
- HoTT in Lean 3☆82Updated 5 years ago
- A Rocq formalization of information theory and linear error-correcting codes☆71Updated this week
- A proof of Abel-Ruffini theorem.☆30Updated 3 weeks ago
- A survey of semantics styles in Coq, from natural semantics through structural operational, axiomatic, and denotational semantics, to abs…☆54Updated 3 months ago
- A formalisation of the Calculus of Constructions☆70Updated last year
- 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
- Regular Language Representations in Coq [maintainers=@chdoc,@palmskog]☆45Updated 6 months ago
- Specification of the Cedille Core language☆34Updated 5 years ago
- Formalizations of Gradually Typed Languages in Agda☆58Updated this week
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- A Seamless, Interactive Tactic Learner and Prover for Coq☆78Updated last week
- An equational theorem prover based on Knuth-Bendix completion☆57Updated this week
- A cost-aware logical framework, embedded in Agda.☆67Updated last week
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 3 weeks ago
- A Unifying Cartesian Cubical Set Model☆34Updated 6 years ago
- Miller/pattern unification in Agda☆67Updated last week
- A proof tree viewer that works with Coq through Proof General☆28Updated 4 years ago