GaloisInc / lean-haskell-bindingsLinks
Haskell Bindings to the Lean Theorem Prover http://leanprover.github.io/
☆22Updated 8 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:
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- Accepted papers for ICFP 2015☆45Updated 9 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 8 years ago
- ☆17Updated 3 years ago
- Haskell Equational Reasoning Model-to-Implementation Tunnel☆49Updated 2 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- ET (IPL) language interpreters and literature☆26Updated 6 years ago
- Ring solver for Idris☆20Updated 6 years ago
- HoTT proofs using experimental induction-induction (mostly about real numbers) (used to contain the HoTT.Classes proofs)☆15Updated 4 years ago
- Plover is a language for matrix algebra on embedded systems.☆48Updated 4 years ago
- second-order abstract syntax☆31Updated 4 years ago
- A classical propositional theorem prover in Haskell, using Wang's Algorithm.☆36Updated 6 years ago
- System F in coq.☆19Updated 10 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆31Updated last year
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆110Updated 6 years ago
- Link to preprints for POPL'18 and colocated events☆86Updated 7 years ago
- ☆14Updated 8 years ago
- Implementation of Univalence in Cubical Sets☆147Updated 10 years ago
- An implementation of Functional Reactive Programming☆40Updated 10 years ago
- Hopefully verifiable code generation in GHC☆94Updated 8 years ago
- ☆84Updated 8 years ago
- A formalization of M-types in Agda☆36Updated 5 years ago
- ☆31Updated 11 years ago
- Mindless, verified (erasably) coding using dependent types☆105Updated 9 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 11 months ago
- ☆45Updated 6 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago