OPLSS / oplss-notes-2021Links
Materials for OPLSS 2021
☆11Updated 4 years ago
Alternatives and similar repositories for oplss-notes-2021
Users that are interested in oplss-notes-2021 are comparing it to the libraries listed below
Sorting:
- Notes and handouts from OPLSS 2019☆34Updated 6 years ago
- Educational Proof Assistant for Type Theory☆81Updated last month
- The Penn Locally Nameless Metatheory Library☆76Updated 9 months ago
- Implementation of Polymorphic Gradual Typing☆12Updated 7 years ago
- A graduate seminar on SMT solving and solver-aided systems☆28Updated 3 years ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆29Updated 2 weeks ago
- Luck -- A Language for Property-Based Generators☆35Updated 10 months ago
- ☆56Updated this week
- Constructive Galois connections☆36Updated 7 years ago
- Relation algebra library for Coq☆49Updated last month
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 4 months ago
- Staged Abstract Interpreters☆69Updated 2 years ago
- A monadic library for symbolic evaluation☆73Updated 5 months ago
- A style guide for Coq☆18Updated 4 years ago
- Formalizations of Gradually Typed Languages in Agda☆59Updated 3 weeks ago
- Mechanized baselines for various type system features☆17Updated last month
- Unification and type inference algorithms☆127Updated 10 years ago
- A cost-aware logical framework, embedded in Agda.☆69Updated 2 months ago
- A Gradual Dependently-typed Language☆14Updated 6 years ago
- Coq formalizations of Sequent Calculus, Natural Deduction, etc. systems for propositional logic☆45Updated 9 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆67Updated last year
- Certified Machine Learning☆41Updated 4 years ago
- ☆53Updated 2 months ago
- Formalization of CBPV extended with effect and coeffect tracking☆14Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Course Webpage for B522 Programming Language Foundations, Spring 2020, Indiana University☆55Updated 5 years ago
- A proof of Abel-Ruffini theorem.☆30Updated 2 months ago
- Intrinsic Verification of Formal Grammar Theory☆27Updated last month
- Course on Metaprogramming☆74Updated 6 months ago
- Coq formalizations and proofs of (data) structures and algorithms.☆47Updated 7 years ago