OPLSS / oplss-notes-2021
Materials for OPLSS 2021
☆11Updated 3 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
- A monadic library for symbolic evaluation☆58Updated last month
- NbE course @ Chalmers☆28Updated 6 months ago
- ☆54Updated last month
- Unification and type inference algorithms☆125Updated 10 years ago
- Relation algebra library for Coq☆48Updated this week
- ☆21Updated 3 years ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated 2 years ago
- Notes and handouts from OPLSS 2018☆54Updated 6 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Untitled PL Card Game☆20Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 2 weeks ago
- Congruence Closure Procedure in Cubical Agda☆17Updated 4 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- An enhanced unification algorithm for Coq☆54Updated last month
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆31Updated 5 months ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 2 years ago
- Deadlock freedom by type checking☆19Updated last year
- Sturdy is a library for developing sound static analyses in Haskell.☆61Updated last year
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆33Updated 2 months ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- ☆11Updated 3 years ago
- Typing the linear pi calculus in Agda☆29Updated 3 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- QuickCheck extension for higher-order properties☆17Updated 3 years ago
- Finite sets and maps for Coq with extensional equality☆30Updated 3 months ago
- Constructive Galois connections☆32Updated 7 years ago
- Coq formalizations and proofs of (data) structures and algorithms.☆46Updated 6 years ago