slasser / vermillion
LL(1) parser generator verified in Coq
☆46Updated 5 years ago
Alternatives and similar repositories for vermillion:
Users that are interested in vermillion are comparing it to the libraries listed below
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 3 weeks ago
- ☆36Updated 3 years ago
- General topology in Coq [maintainers=@amiloradovsky,@Columbus240,@stop-cran]☆47Updated 5 months ago
- A verified compiler for a lazy functional language☆34Updated 2 weeks ago
- Formalising session types in Coq☆17Updated 5 years ago
- ☆29Updated last year
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆31Updated 8 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆49Updated 7 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Monadic effects and equational reasonig in Coq☆70Updated last month
- An enhanced unification algorithm for Coq☆55Updated this week
- Total Parser Combinators in Coq [maintainer=@womeier]☆43Updated last month
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 9 months ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- a version of the 2048 game for Coq☆22Updated last year
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆28Updated 2 weeks ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 5 months ago
- Algebraic proof discovery in Agda☆32Updated 3 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated 4 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Coq library on rewriting theory and termination☆36Updated last month
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- ♾️ A library for universe levels and universe polymorphism☆34Updated 4 months ago
- A formalisation of the Calculus of Constructions☆68Updated 8 months ago