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
Sorting:
- Coq formalizations and proofs of (data) structures and algorithms.☆46Updated 7 years ago
- ☆55Updated last month
- Unification and type inference algorithms☆125Updated 10 years ago
- Notes and handouts from OPLSS 2018☆55Updated 6 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆53Updated 8 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- The Penn Locally Nameless Metatheory Library☆74Updated last month
- Deadlock freedom by type checking☆20Updated last year
- Sturdy is a library for developing sound static analyses in Haskell.☆61Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆28Updated last week
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆31Updated 6 months ago
- An enhanced unification algorithm for Coq☆56Updated last month
- Constructive Galois connections☆32Updated 7 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆59Updated 8 months ago
- Implementation of Nuprl's type theory in Coq☆45Updated 5 months ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated 2 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆81Updated 3 years ago
- ☆21Updated 3 years ago
- Old Coq plugin for parametricity [maintainer=@ppedrot]☆45Updated 3 weeks ago
- A monadic library for symbolic evaluation☆60Updated last week
- Lambda normalization and conversion checking benchmarks for various implementations☆58Updated 4 years ago
- Provides a reference implementation of FeatherweightRust in Java.☆14Updated 3 years ago
- NbE course @ Chalmers☆28Updated 7 months ago
- We define a simple programming language, simp_lang, then instantiate Iris to verify simple simp_lang programs with concurrent separation …☆51Updated 2 months ago
- Logical Relation for MLTT in Coq☆24Updated this week
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 2 months ago
- Bedrock Bit Vector Library☆27Updated last year
- A Gradual Dependently-typed Language☆14Updated 5 years ago
- An automated theorem prover for intuitionistic propostional logic☆12Updated 4 years ago
- Gallina to Bedrock2 compilation toolkit☆54Updated this week