desi-ivanov / agda-regexp-automata
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
- 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
- A Logical Relation for Martin-Löf Type Theory in Agda☆52Updated 7 months ago
- HoTT in Lean 3☆80Updated 4 years ago
- A Unifying Cartesian Cubical Set Model☆35Updated 5 years ago
- An itree-like data-structure to additionally support internal non-determinism☆17Updated last month
- Partial Commutative Monoids☆28Updated this week
- LL(1) parser generator verified in Coq☆46Updated 5 years ago
- Specification of the Cedille Core language☆29Updated 4 years ago
- Formal Topology in Univalent Foundations (WIP).☆36Updated 2 years ago
- ☆36Updated 3 years ago
- A (formalised) general definition of type theories☆57Updated 3 years ago
- Reference type checker for the Lean theorem prover☆62Updated 8 years ago
- Datatypes as quotients of polynomial functors☆35Updated 5 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆75Updated 5 months ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Experiments with higher-order abstract syntax in Agda☆21Updated 2 years ago
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆49Updated 7 months ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆59Updated 7 months ago
- Paper and talk☆54Updated last year
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- Graph Theory [maintainers=@chdoc,@damien-pous]☆35Updated last week
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆81Updated 4 years ago
- Coq library on rewriting theory and termination☆36Updated 2 months ago
- ☆33Updated 7 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆48Updated 3 years ago
- Lean type-checker written in Scala.☆36Updated 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 10 months ago
- Demo for dependent types + runtime code generation☆69Updated 2 months ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆44Updated last year