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
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Coq formalizations and proofs of (data) structures and algorithms.☆46Updated 6 years ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated 2 years ago
- Logical relation for predicative CC omega with booleans and an intensional identity type☆12Updated this week
- A monadic library for symbolic evaluation☆60Updated last week
- ☆55Updated 3 weeks ago
- Sturdy is a library for developing sound static analyses in Haskell.☆61Updated last year
- Formalization of CBPV extended with effect and coeffect tracking☆12Updated 7 months ago
- Best of POPL (BOP) Reading Group Memoirs☆67Updated 3 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆58Updated 7 months ago
- An enhanced unification algorithm for Coq☆55Updated 2 weeks ago
- We define a simple programming language, simp_lang, then instantiate Iris to verify simple simp_lang programs with concurrent separation …☆50Updated last month
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Deadlock freedom by type checking☆20Updated last year
- Denotational semantics based on graph and filter models☆23Updated 4 months ago
- Typing the linear pi calculus in Agda☆29Updated 3 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Provides a reference implementation of FeatherweightRust in Java.☆14Updated 3 years ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆33Updated 3 months ago
- Notes and handouts from OPLSS 2018☆54Updated 6 years ago
- Congruence Closure Procedure in Cubical Agda☆17Updated 4 years ago
- Finite sets and maps for Coq with extensional equality☆30Updated 4 months ago
- ☆11Updated 3 years ago
- An automated theorem prover for intuitionistic propostional logic☆12Updated 4 years ago
- Benchmark repository of polyglot effect handler examples☆23Updated last week
- An interactive theorem prover based on lambda-tree syntax☆94Updated 2 months ago
- Relation algebra library for Coq☆48Updated 3 weeks ago
- NbE course @ Chalmers☆28Updated 7 months ago
- Gallina to Bedrock2 compilation toolkit☆53Updated 2 weeks ago