desi-ivanov / agda-regexp-automata
Formalization of Regular Languages in Agda: regular expressions, finite-state automata, proof of equivalence, proof of the pumping lemma.
☆17Updated 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
- A verified compiler for a lazy functional language☆33Updated this week
- LL(1) parser generator verified in Coq☆45Updated 5 years ago
- Graph Theory [maintainers=@chdoc,@damien-pous]☆35Updated this week
- HoTT in Lean 3☆78Updated 4 years ago
- Datatypes as quotients of polynomial functors☆35Updated 4 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago
- Specification of the Cedille Core language☆29Updated 4 years ago
- Reference type checker for the Lean theorem prover☆61Updated 7 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆74Updated 3 months ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 2 years ago
- Lean type-checker written in Scala.☆34Updated 2 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- A (formalised) general definition of type theories☆57Updated 3 years ago
- a self-hosting lambda calculus compiler☆34Updated 3 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- A non-interactive proof assistant using the Haskell type system☆36Updated 4 years ago
- LeanSSR: an SSReflect-Like Tactic Language for Lean☆34Updated last week
- A Logical Relation for Martin-Löf Type Theory in Agda☆49Updated 5 months ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆50Updated 4 months ago
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆48Updated 4 months ago
- Implementation of Nuprl's type theory in Coq☆44Updated 2 months ago
- An itree-like data-structure to additionally support internal non-determinism☆15Updated 2 months ago
- A formalisation of the Calculus of Constructions☆66Updated 6 months ago
- A quick reference for mapping Coq tactics to Lean tactics☆69Updated 3 years ago
- A Lean 4 library for iterators.☆11Updated last year
- Sturdy is a library for developing sound static analyses in Haskell.☆61Updated last year
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- Regular Language Representations in Coq [maintainers=@chdoc,@palmskog]☆41Updated this week
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Coq library for verified low-level programming☆57Updated 7 years ago