OPLSS / oplss-notes-2019Links
Notes and handouts from OPLSS 2019
☆34Updated 6 years ago
Alternatives and similar repositories for oplss-notes-2019
Users that are interested in oplss-notes-2019 are comparing it to the libraries listed below
Sorting:
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- Implementation of Nuprl's type theory in Coq☆46Updated 11 months ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 2 months ago
- Constructive Galois connections☆35Updated 7 years ago
- Library for Classical Coq☆39Updated 5 months ago
- A cost-aware logical framework, embedded in Agda.☆67Updated last week
- Luck -- A Language for Property-Based Generators☆35Updated 8 months ago
- An enhanced unification algorithm for Coq☆58Updated 7 months ago
- Documentation on goals of the Rocq-community organization, the shared contributing guide and code of conduct.☆68Updated 7 months ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆67Updated last year
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆85Updated 5 years ago
- Algebraic Combinatorics in Coq☆39Updated last month
- BibTeX bibliographies for proof engineering-related papers☆30Updated 6 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆78Updated 2 months ago
- Convert Haskell source code to Coq source code.☆91Updated 4 months ago
- ☆56Updated 3 weeks ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆31Updated 4 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 4 years ago
- Relation algebra library for Coq☆48Updated 2 months ago
- Coq library for tactics, basic definitions, sets, maps☆49Updated last month
- Formalizations of Gradually Typed Languages in Agda☆58Updated this week
- An interactive theorem prover based on lambda-tree syntax☆99Updated last month
- ☆84Updated last year
- The Penn Locally Nameless Metatheory Library☆76Updated 7 months ago
- ☆84Updated 8 years ago
- Gallina to Bedrock2 compilation toolkit☆64Updated last week
- A proof of Abel-Ruffini theorem.☆30Updated last month
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago