autosubst
Syntax automator
Automates formalizing syntactic theories with variable binders in Coq
Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]
52 stars
11 watching
14 forks
Language: Coq
last commit: 2 months ago coqcoq-cidebruijn-indicesmathcompssreflectvariable-binding
Related projects:
| Repository | Description | Stars |
|---|---|---|
| coq-community/dblib | A Coq library for manipulating binding structures in syntax with binders. | 30 |
| coq-community/reglang | Provides definitions and verified translations between various representations of regular languages in the Coq proof assistant | 41 |
| coq-community/semantics | A comprehensive survey of programming language semantics styles implemented in Coq | 45 |
| coq-community/gaia | A Coq implementation of mathematical concepts from N. Bourbaki's Elements of Mathematics | 28 |
| coq-community/lemma-overloading | A Coq library demonstrating design patterns for automated proof automation and canonical structures | 26 |
| coq-community/coq-ext-lib | A collection of reusable Coq definitions and theorems for building software development tools | 129 |
| coq-community/parseque | A Coq library that provides a total parser combinator library with support for building parsers and grammars in the language of Coq. | 42 |
| coq-community/atbr | A Coq library providing algebraic tools and tactics for working with binary relations | 23 |
| coq-community/coq-art | Coq proof assistant book with exercises and examples | 110 |
| coq-community/fav-ssr | A comprehensive library of verified data structures and algorithms in Coq | 45 |
| coq-community/topology | Develops and formalizes basic concepts and results of general topology in Coq. | 47 |
| coq-community/paramcoq | A Coq plugin providing commands for generating parametricity statements used in data refinement proofs. | 44 |
| coq-community/aac-tactics | Tactics for rewriting and proving equations with associativity and commutativity properties | 29 |
| coq-community/corn | A comprehensive formalization of mathematical structures and concepts for verified computation in Coq. | 111 |