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 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 certified semantics for relational programming workout.☆26Updated 4 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- Classical Logic in Haskell☆24Updated 5 months ago
- Type level algebraic "proofs" using lens combinators☆19Updated 6 years ago
- ☆17Updated 6 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
- being the programs and code for a paper about general recursion☆26Updated 10 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
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆35Updated 8 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆11Updated last year
- Lambda Calculus with quote and unquote☆19Updated 5 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- Interactive Theorem Proving for students☆20Updated 2 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 3 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 8 months ago
- Demo code for the talk Dependent Types in Haskell in Hong Kong Functional Programming meetup☆16Updated 6 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- A formalization of finite, constructive log analysis using linear temporal logic☆22Updated this week
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆27Updated last year
- A simple implementation of linear type theory☆38Updated 8 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Source files used for the Cedille Cast videos☆12Updated 4 years ago
- Compiler for IMP programming language implemented in Haskell☆16Updated 5 years ago
- Experiments with effect systems☆12Updated 9 years ago