nomeata / incredible
The Incredible Proof Machine
☆367Updated last year
Alternatives and similar repositories for incredible:
Users that are interested in incredible are comparing it to the libraries listed below
- Experimental implementation of Cubical Type Theory☆574Updated last year
- Examples of Dependently-typed programs in Haskell☆304Updated 2 years ago
- A demo implementation of a simple dependently-typed language☆588Updated 2 months ago
- A new Categories library for Agda☆374Updated 2 weeks ago
- Development of homotopy type theory in Agda☆422Updated 5 years ago
- The People's Refinement Logic☆228Updated 2 years ago
- A bare-bones calculus-of-constructions☆375Updated 2 years ago
- A web site for converting haskell code into pointfree haskell code☆162Updated 2 years ago
- Parsing all context-free grammars using Earley's algorithm in Haskell.☆369Updated last year
- Minimal implementations for dependent type checking and elaboration☆636Updated 3 weeks ago
- Algebraic graphs☆734Updated 8 months ago
- SMT Based Verification in Haskell. Express properties about Haskell programs and automatically prove them using SMT solvers.☆251Updated this week
- Programming language agnostic type construction language based on polynomials.☆367Updated 8 months ago
- The Ott tool for writing definitions of programming languages and calculi☆361Updated last month
- A formalised, cross-linked reference resource for mathematics done in Homotopy Type Theory☆355Updated this week
- An axiom-free formalization of category theory in Coq for personal study and practical work☆763Updated 3 weeks ago
- Koans are small lessons on the path to enlightenment. The aim of the Idris Koans project is to provide an easy learning environment in Id…☆177Updated 6 years ago
- Convert Haskell source code to Coq source code☆280Updated 4 years ago
- A port of Coq to Javascript -- Run Coq in your Browser☆522Updated 3 months ago
- Classic Algorithm W for type inference.☆253Updated 14 years ago
- A black hole raytracer written in Haskell☆171Updated 3 years ago
- An introductory course to Homotopy Type Theory☆364Updated 4 years ago
- Voevodsky's original development of the univalent foundations of mathematics in Coq☆241Updated 10 years ago
- Type safe interface for working in subcategories of Hask☆419Updated 5 years ago
- Software Foundations in Idris☆454Updated 5 years ago
- 15-819 (Homotopy Type Theory) Lecture Notes☆53Updated 4 years ago
- Demo for high-performance type theory elaboration☆538Updated last year
- Functional programming with fewer indirections☆760Updated 4 years ago
- Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations☆371Updated last year
- Lecture notes on univalent foundations of mathematics with Agda☆223Updated 10 months ago