desi-ivanov / agda-regexp-automata
Formalization of Regular Languages in Agda: regular expressions, finite-state automata, proof of equivalence, proof of the pumping lemma.
☆15Updated 4 years ago
Related projects: ⓘ
- Specification of the Cedille Core language☆29Updated 4 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 2 years ago
- Automatically exported from code.google.com/p/ghilbert☆48Updated 6 years ago
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆43Updated 3 weeks ago
- a self-hosting lambda calculus compiler☆34Updated 3 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- HoTT in Lean 3☆75Updated 4 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆20Updated 3 months ago
- Regular Language Representations in Coq [maintainers=@chdoc,@palmskog]☆42Updated last month
- A formalization of M-types in Agda☆32Updated 4 years ago
- A dependent type theory with user defined data types☆46Updated 2 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆52Updated 4 months ago
- LL(1) parser generator verified in Coq☆44Updated 4 years ago
- LeanSSR: an SSReflect-Like Tactic Language for Lean☆31Updated last week
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆69Updated 3 weeks ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- Coq Enhancement Proposals☆43Updated last week
- Work in progress on semi-simplicial types☆23Updated last year
- A nano "theorem prover".☆61Updated 5 years ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆64Updated 7 years ago
- Implementation of Nuprl's type theory in Coq☆44Updated 3 years ago
- ♾️ A library for universe levels and universe polymorphism☆32Updated 3 months ago
- Two-Level Type Theory☆27Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- Datatypes as quotients of polynomial functors☆33Updated 4 years ago
- A non-interactive proof assistant using the Haskell type system☆35Updated 4 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 5 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 3 years ago