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 5 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:
- HoTT in Lean 3☆80Updated 5 years ago
- Specification of the Cedille Core language☆32Updated 5 years ago
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆50Updated 2 months ago
- Hoare Type Theory☆77Updated 2 months ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆75Updated 8 years ago
- Educational Proof Assistant for Type Theory☆74Updated last year
- Automatically exported from code.google.com/p/ghilbert☆48Updated 7 years ago
- An itree-like data-structure to additionally support internal non-determinism☆18Updated last month
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆76Updated last week
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆28Updated 2 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 3 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 11 months ago
- Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.☆85Updated 4 years ago
- A (formalised) general definition of type theories☆57Updated 4 years ago
- Coq course at Chalmers CSE☆39Updated 8 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated 3 weeks ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- Macro Lambda Calculus☆49Updated 6 years ago
- Parser Combinator Library for Lean 4☆56Updated 2 weeks ago
- A verified compiler for a lazy functional language☆37Updated last week
- Lecture notes on realizability☆74Updated 6 months ago
- Coq library for verified low-level programming☆60Updated 8 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆60Updated last year
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- Coq Protocol Playground with Se(xp)rialization of Internal Structures.☆133Updated 9 months ago
- LeanSSR: an SSReflect-Like Tactic Language for Lean☆38Updated last month
- Real number computation software☆126Updated 3 years ago
- Datatypes as quotients of polynomial functors☆36Updated 5 years ago
- Algebraic proof discovery in Agda☆34Updated 3 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆72Updated 4 years ago