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
- A mechanisation of Wasm in Isabelle.☆31Updated last week
- HoTT in Lean 3☆82Updated 5 years ago
- Hoare Type Theory☆84Updated 7 months ago
- The Next Generation of Compositional Programming☆56Updated 3 weeks ago
- A formal consistency proof of Quine's set theory New Foundations☆77Updated 7 months ago
- Coq library for verified low-level programming☆61Updated 8 years ago
- Lean type-checker written in Scala.☆40Updated 3 years ago
- An interactive theorem prover based on lambda-tree syntax☆98Updated last week
- An automated theorem prover that uses Büchi automata.☆44Updated 4 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆80Updated 4 months ago
- ☆46Updated 4 months ago
- Python bindings for the Coq interactive proof assistant☆57Updated 4 years ago
- Educational Proof Assistant for Type Theory☆81Updated last week
- Bologna Optimal Higher-Order Machine, Version 1.1☆83Updated 8 years ago
- Gallina to Bedrock2 compilation toolkit☆65Updated 2 weeks ago
- Coq Protocol Playground with Se(xp)rialization of Internal Structures.☆137Updated last month
- Metamath-knife can rapidly verify Metamath proofs, providing strong confidence that the proofs are correct.☆40Updated 8 months ago
- A formalisation of the Calculus of Constructions☆70Updated last year
- Reference type checker for the Lean theorem prover☆64Updated 8 years ago
- LL(1) parser generator verified in Coq☆48Updated 5 years ago
- EGraphs in OCaml☆79Updated 2 years ago
- a self-hosting lambda calculus compiler☆37Updated 9 months ago
- A deterministic parser with fused lexing☆75Updated 2 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Updated 5 years ago
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆55Updated 2 months ago
- λ² is a tool for synthesizing functional programs from input-output examples.☆87Updated 2 years ago
- A proof checker meant for education. Primarily for teaching proofs of correctness of functional programs.☆121Updated 2 weeks ago
- An encyclopedia of proofs☆64Updated last year
- Automatically exported from code.google.com/p/ghilbert☆47Updated 8 years ago