uwplse / StructTact
Coq utility and tactic library.
☆21Updated last year
Alternatives and similar repositories for StructTact:
Users that are interested in StructTact are comparing it to the libraries listed below
- Relation algebra library for Coq☆48Updated last week
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆56Updated 6 months ago
- Notes and handouts from OPLSS 2018☆54Updated 6 years ago
- Constructive Galois connections☆32Updated 7 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
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆33Updated 2 months ago
- Partial Commutative Monoids☆28Updated 2 months ago
- Work in progress☆34Updated 4 months ago
- being the materials for Summer 2013's course☆112Updated last year
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆31Updated 5 months ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 2 weeks ago
- BibTeX bibliographies for proof engineering-related papers☆30Updated 5 years ago
- Sturdy is a library for developing sound static analyses in Haskell.☆61Updated last year
- Some scripts to help construct small reproducing examples of bugs, implement [Proof using], etc.☆42Updated this week
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- A reflection-based proof tactic for lattices in Coq☆21Updated last year
- Library to create Coq record update functions☆45Updated last month
- An enhanced unification algorithm for Coq☆54Updated last month
- The Penn Locally Nameless Metatheory Library☆74Updated last week
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Implementation of Nuprl's type theory in Coq☆45Updated 3 months ago
- A blog about Coq☆47Updated 2 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- A TACtic library for Agda☆48Updated 6 months ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- Unification and type inference algorithms☆125Updated 10 years ago