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:
- ☆14Updated 8 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- ☆17Updated 2 years ago
- Ring solver for Idris☆20Updated 6 years ago
- [Talk] Framing the Discussion with EDSLs☆9Updated 10 years ago
- ET (IPL) language interpreters and literature☆26Updated 6 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- Deep embedding of imperative programs with code generation☆23Updated 3 years ago
- ☆31Updated 10 years ago
- The core logical system of the HaskHOL theorem prover. See haskhol.org for more details.☆2Updated 8 years ago
- HoTT proofs using experimental induction-induction (mostly about real numbers) (used to contain the HoTT.Classes proofs)☆15Updated 4 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- A classical propositional theorem prover in Haskell, using Wang's Algorithm.☆36Updated 6 years ago
- Dump GHC's abstract syntax trees☆41Updated 3 years ago
- Succinct vectors☆20Updated 6 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- lazy continued fractions☆19Updated 9 years ago
- "Toy" SMT Solver for Educational Purposes☆20Updated 12 years ago
- ☆45Updated 6 years ago
- Haskell Equational Reasoning Model-to-Implementation Tunnel☆49Updated 2 years ago
- being some experiments, working towards some equipment I wish I had☆37Updated 9 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- being a slightly rethought version of the Frank implementation☆23Updated 9 years ago
- Automatically make lenses from data structures implementing Generic☆26Updated 10 years ago
- System F in coq.☆19Updated 10 years ago
- Cryptographic Constructions in the Type Theory of Agda☆52Updated 9 years ago
- Examples of relevant technologies for implementing DSLs in Haskell.☆15Updated 9 years ago
- YUP is a proof checker that performs automatic checking of simple program-correctness proofs of functional programs through inductive and…☆36Updated 2 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago