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:
- Specification of the Cedille Core language☆34Updated 5 years ago
- Educational Proof Assistant for Type Theory☆81Updated last week
- Metamath-knife can rapidly verify Metamath proofs, providing strong confidence that the proofs are correct.☆37Updated 7 months ago
- Hoare Type Theory☆83Updated 5 months ago
- A mechanisation of Wasm in Isabelle.☆30Updated 2 weeks ago
- A formal consistency proof of Quine's set theory New Foundations☆75Updated 5 months ago
- Reference compiler for c0☆38Updated 3 weeks ago
- HoTT in Lean 3☆82Updated 5 years ago
- SPSC: A Small Positive Supercompiler☆38Updated last year
- LeanSSR: an SSReflect-Like Tactic Language for Lean☆39Updated last week
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆53Updated 3 weeks ago
- Convert Haskell source code to Coq source code.☆93Updated 5 months ago
- Code samples for Lean 4☆77Updated 2 years ago
- Gallina to Bedrock2 compilation toolkit☆65Updated 2 weeks ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆79Updated 3 months ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆28Updated 3 years ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆83Updated 8 years ago
- Automatically exported from code.google.com/p/ghilbert☆47Updated 8 years ago
- Python bindings for the Coq interactive proof assistant☆57Updated 3 years ago
- Real number computation software☆128Updated 3 years ago
- A proof checker meant for education. Primarily for teaching proofs of correctness of functional programs.☆119Updated this week
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆61Updated last year
- Lean type-checker written in Scala.☆40Updated 3 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 3 years ago
- Hitchhiker's Guide to Logical Verification (2023 Edition)☆112Updated 2 years ago
- Two-Level Type Theory☆28Updated 5 years ago
- The Next Generation of Compositional Programming☆54Updated 3 weeks ago
- An itree-like data-structure to additionally support internal non-determinism☆20Updated 2 weeks ago
- A toy functional language based on modal type theory. Try it online: https://mtt-lang.github.io/mtt-web☆46Updated 3 years ago