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:
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- Type level algebraic "proofs" using lens combinators☆19Updated 6 years ago
- Demo code for the talk Dependent Types in Haskell in Hong Kong Functional Programming meetup☆16Updated 6 years ago
- Template repo for theorem proving in Liquid Haskell☆32Updated 7 years ago
- ☆17Updated 7 years ago
- Dependently typed elimination functions using singletons☆28Updated 9 months 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
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Lambda Calculus with quote and unquote☆19Updated 5 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 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
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- Classical Logic in Haskell☆24Updated 7 months ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 10 months ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆11Updated last year
- An interpreter for the concatenative language Joy, written in Haskell using extensible-effects☆35Updated last year
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated last year
- Experimental normalisation via scheme☆12Updated 4 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- Matita (proof assistant) with embedded elpi☆14Updated 7 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 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.☆22Updated 8 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- A formal verification of Linear Temporal Logic in Coq☆23Updated last week