katydid / regex-deriv-coqLinks
☆23Updated 9 months ago
Alternatives and similar repositories for regex-deriv-coq
Users that are interested in regex-deriv-coq are comparing it to the libraries listed below
Sorting:
- Sturdy is a library for developing sound static analyses in Haskell.☆62Updated 2 years ago
- A framework for implementing and certifying impure computations in Coq☆53Updated last year
- Formalization of Typed Assembly Language (TAL) in Coq☆17Updated last year
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated last month
- Genetic program repair using GHC☆30Updated last year
- Coq formalization of decision procedures for regular expression equivalence [maintainer=@anton-trunov]☆13Updated last year
- Implementation of Nuprl's type theory in Coq☆45Updated 9 months ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆62Updated last year
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆84Updated 5 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 6 months ago
- The Coq Effective Algebra Library [maintainers=@CohenCyril,@proux01]☆72Updated 2 weeks ago
- Learn the Agda basics in three 2-hour sessions.☆60Updated last year
- Relation algebra library for Coq☆49Updated last week
- Some programs from Rustan Leino's "Program Proofs", in Why3.☆16Updated 2 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆72Updated 6 years ago
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 4 years ago
- Monadic effects and equational reasoning in Rocq☆72Updated last week
- Formal semantics in Agda.☆16Updated 10 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Finite sets and maps for Coq with extensional equality☆30Updated 3 months ago
- ☆84Updated 8 years ago
- A cost-aware logical framework, embedded in Agda.☆66Updated 2 weeks ago
- Notes and handouts from OPLSS 2019☆34Updated 6 years ago
- Formal Topology in Univalent Foundations (WIP).☆36Updated 3 years ago
- Untitled PL Card Game☆20Updated 4 years ago
- Paper and talk☆55Updated 2 years ago
- Constructive Galois connections☆35Updated 7 years ago
- Coq library on rewriting theory and termination☆36Updated last month
- LL(1) parser generator verified in Coq☆47Updated 5 years ago