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:
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 8 years ago
- Haskell Equational Reasoning Model-to-Implementation Tunnel☆49Updated 2 years ago
- ☆17Updated 3 years ago
- System F in coq.☆19Updated 10 years ago
- being some experiments, working towards some equipment I wish I had☆37Updated 9 years ago
- second-order abstract syntax☆31Updated 4 years ago
- A hip inductive theorem prover!☆90Updated 4 years ago
- ET (IPL) language interpreters and literature☆26Updated 6 years ago
- 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
- Use Conal Elliott's concat library to compile regular Haskell functions into Z3 equations☆38Updated 8 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- An implementation of Functional Reactive Programming☆41Updated 10 years ago
- ☆14Updated 8 years ago
- HoTT proofs using experimental induction-induction (mostly about real numbers) (used to contain the HoTT.Classes proofs)☆16Updated 5 years ago
- Succinct vectors☆20Updated 6 years ago
- Ring solver for Idris☆20Updated 7 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- Simple lambda prover☆24Updated 10 years ago
- Type-safe library for generating haskell source code☆28Updated 7 years ago
- Hopefully verifiable code generation in GHC☆94Updated 8 years ago
- Automatically make lenses from data structures implementing Generic☆26Updated 10 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Examples of relevant technologies for implementing DSLs in Haskell.☆15Updated 10 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆31Updated 2 years ago
- A classical propositional theorem prover in Haskell, using Wang's Algorithm.☆36Updated 6 years ago
- Miller/pattern unification in Agda☆66Updated last month
- Accepted papers for ICFP 2015☆45Updated 9 years ago