lastland / WebSpecLinks
☆17Updated 8 years ago
Alternatives and similar repositories for WebSpec
Users that are interested in WebSpec are comparing it to the libraries listed below
Sorting:
- ☆29Updated 10 years ago
- ☆21Updated 9 years ago
- Luck -- A Language for Property-Based Generators☆36Updated 10 months ago
- "Toy" SMT Solver for Educational Purposes☆20Updated 12 years ago
- Constructive Galois connections☆36Updated 7 years ago
- Problem Sets for MIT 6.887 Formal Reasoning About Programs, Spring 2017☆20Updated 8 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago
- Code for "Staged Generic Programming" (ICFP 2017)☆28Updated 2 years ago
- Some scripts for analyzing IMP programs with the Z3 automatic theorem prover, originally written for my Compose 2016 talk.☆15Updated 9 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 7 months ago
- Accepted papers for ICFP 2015☆45Updated 9 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 8 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- Experiments in abstracting definitional interpreters☆16Updated 8 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- Reflection library for Coq☆12Updated 6 years ago
- Bedrock Bit Vector Library☆28Updated 2 months ago
- Formal topology (and some probability) in Coq☆31Updated 7 years ago
- ☆42Updated 7 years ago
- A collection of small projects to illustrate how to write plugins for Coq☆21Updated 7 years ago
- HoTT proofs using experimental induction-induction (mostly about real numbers) (used to contain the HoTT.Classes proofs)☆17Updated 5 years ago
- Haskell Bindings to the Lean Theorem Prover http://leanprover.github.io/☆22Updated 8 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- An enhanced unification algorithm for Coq☆58Updated last month
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- Formal proof in Coq of Banach-Tarski paradox.☆19Updated last week
- Formalizing nbe in agda☆32Updated 13 years ago
- secret project☆17Updated 7 years ago