Tritlo / PropRLinks
Genetic program repair using GHC
☆33Updated last year
Alternatives and similar repositories for PropR
Users that are interested in PropR are comparing it to the libraries listed below
Sorting:
- Sturdy is a library for developing sound static analyses in Haskell.☆62Updated 2 years ago
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 3 years ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 4 months ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆29Updated this week
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- A monadic library for symbolic evaluation☆73Updated 5 months ago
- Formalization of C++ for verification purposes.☆85Updated this week
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 7 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆28Updated 3 years ago
- Relation algebra library for Coq☆49Updated 3 weeks ago
- Coq formalization of decision procedures for regular expression equivalence [maintainer=@anton-trunov]☆14Updated last year
- A parser based on the ALL(*) algorithm, implemented and verified in Coq.☆13Updated 2 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 9 months ago
- A rosetta stone for metaprogramming in Coq, with different examples of tactics, plugins, etc implemented in different metaprogramming lan…☆17Updated last year
- Finite sets and maps for Coq with extensional equality☆30Updated last month
- ☆21Updated 4 years ago
- Typing the linear pi calculus in Agda☆29Updated 3 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 3 months ago
- ☆53Updated 2 months ago
- CS410 "Advanced Functional Programming"☆28Updated 7 months ago
- ☆23Updated last year
- A OCaml generator for well-typed terms (that use their arguments).☆11Updated 10 months ago
- Deadlock freedom by type checking☆20Updated 2 years ago
- A style guide for Coq☆18Updated 4 years ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆63Updated 5 months ago
- Some scripts for analyzing IMP programs with the Z3 automatic theorem prover, originally written for my Compose 2016 talk.☆15Updated 9 years ago
- Algebraic proof discovery in Agda☆35Updated 4 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Formal semantics in Agda.☆16Updated 10 years ago