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
- Datatypes as quotients of polynomial functors☆35Updated 4 years ago
- Lean type-checker written in Scala.☆35Updated 3 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 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
- Book about using Lean with How To Prove It☆17Updated 3 months ago
- LL(1) parser generator verified in Coq☆46Updated 5 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆58Updated 11 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 10 months ago
- HoTT in Lean 3☆79Updated 4 years ago
- A verified compiler for a lazy functional language☆35Updated 2 weeks ago
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆48Updated 6 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- a self-hosting lambda calculus compiler☆35Updated 2 weeks ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- Template to effortlessly build math-rich websites☆39Updated 3 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆49Updated 7 months ago
- Specification of the Cedille Core language☆29Updated 4 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆75Updated 5 months ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 2 years ago
- A non-interactive proof assistant using the Haskell type system☆37Updated 5 years ago
- A Unifying Cartesian Cubical Set Model☆35Updated 5 years ago
- Formalization of type theory☆22Updated 3 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated 4 months ago
- Duo - A research language exploring duality in programming language design☆57Updated last year
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Parser Combinator Library for Lean 4☆47Updated last week
- Formalizing linear algebra in Agda by representing matrices as functions☆26Updated last year
- A basic type system on top of Prolog, along with higher-order clauses. Translates to normal Prolog.☆29Updated 7 years ago
- Demo for dependent types + runtime code generation☆69Updated 2 months ago