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:
- The core logical system of the HaskHOL theorem prover. See haskhol.org for more details.☆2Updated 8 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 5 years ago
- HoTT proofs using experimental induction-induction (mostly about real numbers) (used to contain the HoTT.Classes proofs)☆15Updated 4 years ago
- ☆17Updated 2 years ago
- An implementation of Functional Reactive Programming☆40Updated 10 years ago
- Generic unification-based type inference library☆25Updated 10 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- Work in progress☆37Updated 2 weeks ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- Hopefully verifiable code generation in GHC☆94Updated 8 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- Paper about polynomial functors, regular expressions, matrices of types, derivatives, semirings, and other cool stuff☆13Updated 7 years ago
- being some experiments, working towards some equipment I wish I had☆37Updated 9 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last week
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆73Updated 3 years ago
- Cohesive type theory☆19Updated 3 years ago
- System F in coq.☆19Updated 10 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- ☆14Updated 8 years ago
- Formalizing nbe in agda☆31Updated 12 years ago
- ET (IPL) language interpreters and literature☆26Updated 6 years ago
- ☆18Updated 8 years ago
- Haskell Equational Reasoning Model-to-Implementation Tunnel☆49Updated 2 years ago
- OCaml backend for Agda☆40Updated 6 years ago