kframework / matching-logic-proverLinks
☆15Updated 4 years ago
Alternatives and similar repositories for matching-logic-prover
Users that are interested in matching-logic-prover are comparing it to the libraries listed below
Sorting:
- ☆29Updated 9 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated 6 months ago
- ☆14Updated 6 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- miniKanren with a first-order representation of the search space☆16Updated 10 months ago
- Gallina to Bedrock2 compilation toolkit☆54Updated this week
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- Relation algebra library for Coq☆48Updated 2 months ago
- Luck -- A Language for Property-Based Generators☆34Updated 3 months ago
- "Toy" SMT Solver for Educational Purposes☆20Updated 12 years ago
- This project contains various supporting libraries for lean to reason about protocols.☆43Updated 7 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Algebraic Combinatorics in Coq☆38Updated 4 months ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- Yet another haskell term rewriting library☆18Updated last year
- A minimalist implementation of type theory, suitable for experimentation☆15Updated 7 months ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Logical relation for predicative CC omega with booleans and an intensional identity type☆13Updated last month
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- A proof of Abel-Ruffini theorem.☆29Updated 2 months ago
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago
- A framework for extensible, reflective decision procedures.☆19Updated 5 years ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- Robots powered by Constructive Reals☆34Updated 7 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
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Updated 7 years ago
- Generic implementation of different CFA families based on monadic decomposition☆21Updated 12 years ago
- ☆55Updated 2 months ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated last month
- A reflection-based proof tactic for lattices in Coq☆22Updated last year