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:
- Learn the Agda basics in three 2-hour sessions.☆59Updated last year
- Formal Topology in Univalent Foundations (WIP).☆36Updated 2 years ago
- ☆29Updated 2 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
- A rosetta stone for metaprogramming in Coq, with different examples of tactics, plugins, etc implemented in different metaprogramming lan…☆17Updated last year
- Deciding Presburger arithmetic in agda☆32Updated 2 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 4 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 weeks ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆27Updated 2 years ago
- Sturdy is a library for developing sound static analyses in Haskell.☆61Updated 2 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 3 months ago
- Stable sort algorithms and their stability proofs in Rocq☆22Updated this week
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 9 months ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- Mtac in Agda☆28Updated 4 years ago
- ☆47Updated 3 weeks ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Paper and talk☆54Updated last year
- A TACtic library for Agda☆48Updated 9 months ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆82Updated 4 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Formalization of Typed Assembly Language (TAL) in Coq☆17Updated last year
- ☆23Updated 11 months ago
- Coq formalization of decision procedures for regular expression equivalence [maintainer=@anton-trunov]☆13Updated 11 months ago
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 3 years ago
- Observational Type Theory as an Agda library☆53Updated 8 years ago