GaloisInc / lean-haskell-bindingsLinks
Haskell Bindings to the Lean Theorem Prover http://leanprover.github.io/
☆21Updated 7 years ago
Alternatives and similar repositories for lean-haskell-bindings
Users that are interested in lean-haskell-bindings are comparing it to the libraries listed below
Sorting:
- Ring solver for Idris☆20Updated 6 years ago
- System F in coq.☆19Updated 10 years ago
- HoTT proofs using experimental induction-induction (mostly about real numbers) (used to contain the HoTT.Classes proofs)☆15Updated 4 years ago
- ☆14Updated 8 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Work in progress☆34Updated this week
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- Generic unification-based type inference library☆25Updated 10 years ago
- [Talk] Framing the Discussion with EDSLs☆9Updated 10 years ago
- The core logical system of the HaskHOL theorem prover. See haskhol.org for more details.☆2Updated 8 years ago
- Web based opetopic editor☆35Updated 7 months ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- Coq proof for the paper "Compiling a Fifty Year Journey"☆13Updated 7 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- Coherence typechecker for Grothendieck/Maltsiniotis style infinity categories☆15Updated 8 years ago
- ☆26Updated 8 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- Formalizing nbe in agda☆31Updated 12 years ago
- Observational Type Theory as an Agda library☆53Updated 8 years ago
- Agda programming with holes☆27Updated 4 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 6 months ago
- The Prettiest Printer☆34Updated last year
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- ☆17Updated 2 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- ☆22Updated 9 years ago