OPLSS / oplss-notes-2019
Notes and handouts from OPLSS 2019
☆34Updated 5 years ago
Related projects ⓘ
Alternatives and complementary repositories for oplss-notes-2019
- BibTeX bibliographies for proof engineering-related papers☆30Updated 5 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆52Updated 2 months ago
- Implementation of Nuprl's type theory in Coq☆44Updated 3 years ago
- A (formalised) general definition of type theories☆56Updated 3 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆71Updated last week
- Notes and handouts from OPLSS 2018☆53Updated 6 years ago
- Agda formalisation of second-order abstract syntax☆52Updated 2 years ago
- Relation algebra library for Coq☆48Updated last week
- Papers on aspects of Generalised Algebraic Theories, Contextual Categories and Mathematical Theory Of Data☆37Updated last month
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated last year
- A cost-aware logical framework, embedded in Agda.☆56Updated 3 months ago
- Algebraic Combinatorics in Coq☆37Updated this week
- Formalizations of Gradually Typed Languages in Agda☆54Updated last month
- An interactive theorem prover based on lambda-tree syntax☆90Updated this week
- Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University☆72Updated 6 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆30Updated last month
- Hoare Type Theory☆69Updated last month
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated last year
- Mechanizations of Type Theories☆27Updated last week
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- Constructive Galois connections☆32Updated 6 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆78Updated 4 years ago
- General topology in Coq [maintainers=@amiloradovsky,@Columbus240,@stop-cran]☆47Updated last month
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 2 months ago
- Unification and type inference algorithms☆123Updated 9 years ago
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆32Updated 2 months ago
- Partial Commutative Monoids☆26Updated 3 weeks ago
- Coq utility and tactic library.☆21Updated 11 months ago
- The Penn Locally Nameless Metatheory Library☆71Updated 4 months ago
- A proof of Abel-Ruffini theorem.☆28Updated last week