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
- The Penn Locally Nameless Metatheory Library☆75Updated 4 months ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated 3 weeks ago
- Constructive Galois connections☆34Updated 7 years ago
- Luck -- A Language for Property-Based Generators☆35Updated 5 months ago
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- A monadic library for symbolic evaluation☆68Updated 3 weeks ago
- Old Coq plugin for parametricity [maintainer=@ppedrot]☆45Updated 3 months ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated 6 months ago
- Documentation on goals of the Rocq-community organization, the shared contributing guide and code of conduct.☆68Updated 4 months ago
- Intrinsic Verification of Formal Grammar Theory☆26Updated 2 weeks ago
- An interactive theorem prover based on lambda-tree syntax☆96Updated 2 months ago
- ☆55Updated 4 months ago
- Relation algebra library for Coq☆49Updated 4 months ago
- Educational Proof Assistant for Type Theory☆74Updated last year
- An enhanced unification algorithm for Coq☆56Updated 3 months ago
- Denotational semantics based on graph and filter models☆23Updated 7 months ago
- Sturdy is a library for developing sound static analyses in Haskell.☆62Updated 2 years ago
- Convert Haskell source code to Coq source code.☆86Updated last month
- Certified Machine Learning☆41Updated 4 years ago
- A cost-aware logical framework, embedded in Agda.☆64Updated last week
- Unification and type inference algorithms☆125Updated 10 years ago
- Logical Relation for MLTT in Coq☆27Updated 3 weeks ago
- We define a simple programming language, simp_lang, then instantiate Iris to verify simple simp_lang programs with concurrent separation …☆52Updated last month
- A Gradual Dependently-typed Language☆14Updated 6 years ago
- An itree-like data-structure to additionally support internal non-determinism☆17Updated 2 weeks ago
- A style guide for Coq☆18Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆25Updated 4 years ago
- Graded Dependent Type systems☆25Updated 2 years ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated last month