desi-ivanov / agda-regexp-automata
Formalization of Regular Languages in Agda: regular expressions, finite-state automata, proof of equivalence, proof of the pumping lemma.
☆17Updated 4 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
- Specification of the Cedille Core language☆29Updated 4 years ago
- A non-interactive proof assistant using the Haskell type system☆36Updated 4 years ago
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆48Updated 3 months ago
- Datatypes as quotients of polynomial functors☆35Updated 4 years ago
- HoTT in Lean 3☆76Updated 4 years ago
- A tutorial on how Agda infers things☆38Updated 4 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆55Updated 8 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆49Updated 4 months ago
- A toy dependent typed language.☆24Updated this week
- A verified compiler for a lazy functional language☆32Updated this week
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 4 months ago
- Inline, type safe X86-64 assembly programming in Agda☆67Updated 6 years ago
- a self-hosting lambda calculus compiler☆34Updated 3 years ago
- Experiments with higher-order abstract syntax in Agda☆19Updated 2 years ago
- Reference type checker for the Lean theorem prover☆61Updated 7 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆72Updated 2 months ago
- An interactive theorem prover based on lambda-tree syntax☆90Updated this week
- Automatically exported from code.google.com/p/ghilbert☆48Updated 7 years ago
- Paper and talk☆49Updated last year
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆21Updated 8 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago
- A (formalised) general definition of type theories☆57Updated 3 years ago
- Lean type-checker written in Scala.☆33Updated 2 years ago
- Software Foundations using the Lean Theorem Prover☆23Updated 4 years ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆67Updated 7 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated 7 months ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 2 years ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆23Updated 2 years ago
- Unification and type inference algorithms☆124Updated 9 years ago
- A parser for ANSI C, in Lean4.☆20Updated last year