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:
- Hoare Type Theory☆77Updated last month
- Specification of the Cedille Core language☆32Updated 5 years ago
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆51Updated last month
- A mechanisation of Wasm in Isabelle.☆27Updated 3 weeks ago
- HoTT in Lean 3☆80Updated 5 years ago
- Educational Proof Assistant for Type Theory☆74Updated last year
- Lean type-checker written in Scala.☆36Updated 3 years ago
- Automatically exported from code.google.com/p/ghilbert☆48Updated 7 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- Coq library for verified low-level programming☆60Updated 8 years ago
- A formal consistency proof of Quine's set theory New Foundations☆73Updated last month
- Coq course at Chalmers CSE☆39Updated 8 years ago
- An automated theorem prover that uses Büchi automata.☆42Updated 3 years ago
- Logic and Mechanized Reasoning☆105Updated 3 weeks ago
- Horn Clause Constraint Solving for Liquid Types☆150Updated 2 weeks ago
- Real number computation software☆126Updated 2 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆75Updated last week
- Coq Protocol Playground with Se(xp)rialization of Internal Structures.☆135Updated 8 months ago
- The Next Generation of Compositional Programming☆52Updated last month
- Bologna Optimal Higher-Order Machine, Version 1.1☆74Updated 8 years ago
- Reference type checker for the Lean theorem prover☆62Updated 8 years ago
- A prototypical dependently typed languages with sized types and variances☆111Updated 2 weeks ago
- Convert Haskell source code to Coq source code.☆86Updated last month
- SPSC: A Small Positive Supercompiler☆38Updated last year
- Human-like theorem prover, inspired by robotone and developed in the Coq ecosystem.☆17Updated 3 years ago
- A toy functional language based on modal type theory. Try it online: https://mtt-lang.github.io/mtt-web☆45Updated 3 years ago
- A (formalised) general definition of type theories☆57Updated 4 years ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated last month
- An interactive theorem prover based on lambda-tree syntax☆96Updated 2 months ago
- Parser Combinator Library for Lean 4☆55Updated 2 weeks ago