nikivazou / proof-combinatorsLinks
Proof combinators used in Liquid Haskell for theorem proving
☆12Updated 7 years ago
Alternatives and similar repositories for proof-combinators
Users that are interested in proof-combinators are comparing it to the libraries listed below
Sorting:
- Template repo for theorem proving in Liquid Haskell☆32Updated 7 years ago
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- Type level algebraic "proofs" using lens combinators☆19Updated 6 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated 2 years ago
- ☆17Updated 7 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- using Data and Typeable to get a direct reflection system for free, when we're implementing a toy language in Haskell☆15Updated 5 years ago
- Demo code for the talk Dependent Types in Haskell in Hong Kong Functional Programming meetup☆16Updated 7 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 4 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- Experimental normalisation via scheme☆12Updated 4 years ago
- Dependently typed elimination functions using singletons☆28Updated last year
- A simple implementation of linear type theory☆38Updated 8 years ago
- Label dependent dependent session types☆16Updated last year
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- Dafny for Metatheory of Programming Languages☆26Updated 3 months ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- Intrinsic Verification of Formal Grammar Theory☆27Updated last month
- A usable type system for call by push-value☆33Updated 6 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Updated 3 years ago
- Bring fusion to everyone☆14Updated 5 years ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆23Updated 9 years ago
- Classical Logic in Haskell☆24Updated last month
- van Laarhoven lenses for Idris☆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