katydid / regex-deriv-coqLinks
☆23Updated 6 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:
- 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 version of the 2048 game for Coq☆22Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆30Updated last month
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 2 months ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- Stable sort algorithms and their stability proofs in Coq☆22Updated last month
- ☆21Updated 3 years ago
- Constructive Galois connections☆32Updated 7 years ago
- Coq formalization of decision procedures for regular expression equivalence [maintainer=@anton-trunov]☆13Updated 10 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 8 months ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Mechanizations of Type Theories☆29Updated 3 months ago
- A rosetta stone for metaprogramming in Coq, with different examples of tactics, plugins, etc implemented in different metaprogramming lan…☆17Updated last year
- Learn the Agda basics in three 2-hour sessions.☆57Updated last year
- ☆29Updated 2 years ago
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- Some programs from Rustan Leino's "Program Proofs", in Why3.☆16Updated 2 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Deciding Presburger arithmetic in agda☆32Updated 2 years ago
- Formalization of Typed Assembly Language (TAL) in Coq☆17Updated last year
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 3 years ago
- ☆47Updated last week
- Correctness of normalization-by-evaluation for STLC☆22Updated 5 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆81Updated 4 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Formalizing nbe in agda☆31Updated 12 years ago