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:
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- ☆55Updated 2 months ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated 2 years ago
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆33Updated last month
- Unification and type inference algorithms☆125Updated 10 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated last month
- ☆21Updated 3 years ago
- Intrinsic Verification of Formal Grammar Theory☆26Updated this week
- The Penn Locally Nameless Metatheory Library☆74Updated 3 months ago
- Relation algebra library for Coq☆48Updated 3 months ago
- Untitled PL Card Game☆20Updated 4 years ago
- Genetic program repair using GHC☆30Updated last year
- Congruence Closure Procedure in Cubical Agda☆17Updated 4 years ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated 4 months ago
- An enhanced unification algorithm for Coq☆56Updated 2 months ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- Proof Updater Mechanically Passing Knowledge Into New Proofs, Assisting The Coq Hacker☆51Updated 11 months ago
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 3 years ago
- NbE course @ Chalmers☆28Updated 9 months ago
- Logical relation for predicative CC omega with booleans and an intensional identity type☆13Updated 2 months ago
- Denotational semantics based on graph and filter models☆23Updated 6 months ago
- An automated theorem prover for intuitionistic propostional logic☆12Updated 4 years ago
- Advanced Topics in Programming Languages, Penn CIS 670, Fall 2016☆42Updated 2 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆32Updated 8 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 3 months ago
- Sturdy is a library for developing sound static analyses in Haskell.☆61Updated 2 years ago
- Deadlock freedom by type checking☆20Updated 2 years ago
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Updated 8 years ago
- MetaML and MetaOCaml bibliography☆92Updated 6 months ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago