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:
- Constructive Galois connections☆35Updated 7 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 4 years ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆25Updated this week
- Notes and handouts from OPLSS 2019☆34Updated 6 years ago
- A Gradual Dependently-typed Language☆14Updated 6 years ago
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- Formalization of CBPV extended with effect and coeffect tracking☆13Updated last year
- Intrinsic Verification of Formal Grammar Theory☆26Updated last month
- Luck -- A Language for Property-Based Generators☆35Updated 6 months ago
- The Penn Locally Nameless Metatheory Library☆75Updated 5 months ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Denotational semantics based on graph and filter models☆23Updated 9 months ago
- A cost-aware logical framework, embedded in Agda.☆66Updated last week
- A monadic library for symbolic evaluation☆69Updated 2 months ago
- A style guide for Coq☆18Updated 3 years ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 3 years ago
- Educational Proof Assistant for Type Theory☆75Updated last year
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆22Updated 8 years ago
- Sturdy is a library for developing sound static analyses in Haskell.☆62Updated 2 years ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated 7 months ago
- A graduate seminar on SMT solving and solver-aided systems☆27Updated 3 years ago
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 3 years ago
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Updated 8 years ago
- ☆53Updated 2 weeks ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆76Updated 3 weeks ago
- Graded Dependent Type systems☆25Updated 2 years ago
- Relation algebra library for Coq☆49Updated 5 months ago
- Congruence Closure Procedure in Cubical Agda☆17Updated 5 years ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 3 weeks ago