desi-ivanov / agda-regexp-automataLinks
Formalization of Regular Languages in Agda: regular expressions, finite-state automata, proof of equivalence, proof of the pumping lemma.
☆18Updated 4 years ago
Alternatives and similar repositories for agda-regexp-automata
Users that are interested in agda-regexp-automata are comparing it to the libraries listed below
Sorting:
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆49Updated 8 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 8 months ago
- Specification of the Cedille Core language☆29Updated 4 years ago
- ☆36Updated 3 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
- Datatypes as quotients of polynomial functors☆35Updated 5 years ago
- Parser Combinator Library for Lean 4☆50Updated this week
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 11 months ago
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆63Updated 7 months ago
- Automated Reasoning for the Working Mathematician☆11Updated 5 years ago
- An itree-like data-structure to additionally support internal non-determinism☆17Updated 2 months ago
- Implementation of Nuprl's type theory in Coq☆45Updated 6 months ago
- A fast, easy-to-use ring solver for agda with step-by-step solutions☆40Updated 3 years ago
- Lean type-checker written in Scala.☆36Updated 3 years ago
- Formalization of type theory☆22Updated 3 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆30Updated 4 years ago
- A verified compiler for a lazy functional language☆36Updated 3 weeks ago
- Accessing Agda's interaction mode via command line & external tactic for Agda.☆26Updated 4 years ago
- Lecture notes on realizability☆72Updated 3 months ago
- Sturdy is a library for developing sound static analyses in Haskell.☆61Updated last year
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- A toy example of a verified compiler.☆28Updated last month
- Paper and talk☆54Updated last year
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- HoTT in Lean 3☆80Updated 4 years ago
- A Seamless, Interactive Tactic Learner and Prover for Coq☆68Updated last month
- A non-interactive proof assistant using the Haskell type system☆37Updated 5 years ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated last month
- Formal Topology in Univalent Foundations (WIP).☆36Updated 2 years ago