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☆33Updated 5 years ago
- A formal consistency proof of Quine's set theory New Foundations☆73Updated 4 months ago
- HoTT in Lean 3☆82Updated 5 years ago
- Educational Proof Assistant for Type Theory☆75Updated last year
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆52Updated last month
- An automated theorem prover that uses Büchi automata.☆43Updated 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…☆28Updated 3 years ago
- Lean type-checker written in Scala.☆38Updated 3 years ago
- Metamath-knife can rapidly verify Metamath proofs, providing strong confidence that the proofs are correct.☆35Updated 5 months ago
- Automatically exported from code.google.com/p/ghilbert☆47Updated 8 years ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆80Updated 8 years ago
- A mechanisation of Wasm in Isabelle.☆27Updated 2 months ago
- Reference type checker for the Lean theorem prover☆64Updated 8 years ago
- Hoare Type Theory☆81Updated 4 months ago
- Lecture notes on realizability☆74Updated 8 months ago
- Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.☆84Updated 4 years ago
- Demo for dependent types + runtime code generation☆72Updated 8 months ago
- Reference compiler for c0☆37Updated 5 months ago
- LeanSSR: an SSReflect-Like Tactic Language for Lean☆38Updated last week
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆78Updated 2 months ago
- The Next Generation of Compositional Programming☆54Updated last month
- Logic and Mechanized Reasoning☆107Updated 3 months ago
- An itree-like data-structure to additionally support internal non-determinism☆20Updated this week
- ☆19Updated 2 years ago
- A (formalised) general definition of type theories☆57Updated 4 years ago
- Python bindings for the Coq interactive proof assistant☆56Updated 3 years ago
- Experiments with SAT solvers with proofs in Lean 4☆62Updated last year
- A toy example of a verified compiler.☆29Updated 6 months ago
- Regular Language Representations in Coq [maintainers=@chdoc,@palmskog]☆45Updated 6 months ago
- Implementation of Nuprl's type theory in Coq☆46Updated 10 months ago