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☆82Updated 5 years ago
- Educational Proof Assistant for Type Theory☆81Updated last month
- A mechanisation of Wasm in Isabelle.☆31Updated last month
- A formal consistency proof of Quine's set theory New Foundations☆76Updated 6 months ago
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆54Updated last month
- Specification of the Cedille Core language☆34Updated 5 years ago
- Lean type-checker written in Scala.☆40Updated 3 years ago
- The Next Generation of Compositional Programming☆56Updated this week
- Metamath-knife can rapidly verify Metamath proofs, providing strong confidence that the proofs are correct.☆37Updated 7 months ago
- Code samples for Lean 4☆77Updated 2 years ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆83Updated 8 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Updated 5 years ago
- Automatically exported from code.google.com/p/ghilbert☆47Updated 8 years ago
- An automated theorem prover that uses Büchi automata.☆43Updated 4 years ago
- Hoare Type Theory☆84Updated 6 months ago
- Quantitative Type Theory implementation☆54Updated 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…☆29Updated 3 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 3 years ago
- Real number computation software☆129Updated 3 years ago
- LeanSSR: an SSReflect-Like Tactic Language for Lean☆39Updated 3 weeks ago
- Coq course at Chalmers CSE☆38Updated 8 years ago
- Datatypes as quotients of polynomial functors☆39Updated 5 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆79Updated 4 months ago
- a self-hosting lambda calculus compiler☆37Updated 9 months ago
- SPSC: A Small Positive Supercompiler☆39Updated last year
- Coq library for verified low-level programming☆61Updated 8 years ago
- Generates natural language versions of Coq proofs☆51Updated 7 years ago
- Python bindings for the Coq interactive proof assistant☆57Updated 3 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- ☆48Updated 2 years ago