OPLSS / oplss-notes-2021
Materials for OPLSS 2021
☆11Updated 3 years ago
Related projects: ⓘ
- Coq formalizations and proofs of (data) structures and algorithms.☆45Updated 6 years ago
- Deadlock freedom by type checking☆19Updated last year
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆61Updated last year
- A monadic library for symbolic evaluation☆51Updated this week
- ☆51Updated last week
- Typing the linear pi calculus in Agda☆28Updated 2 years ago
- BibTeX bibliographies for proof engineering-related papers☆28Updated 5 years ago
- Logical Relation for MLTT in Coq☆19Updated this week
- Coq plugin for parametricity [maintainer=@proux01]☆44Updated this week
- Proof Updater Mechanically Passing Knowledge Into New Proofs, Assisting The Coq Hacker☆50Updated 2 months ago
- Notes and handouts from OPLSS 2018☆53Updated 6 years ago
- Tons of Inductive Problems: The Benchmarks☆24Updated last year
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆32Updated last week
- NbE course @ Chalmers☆28Updated 4 years ago
- Relation algebra library for Coq☆43Updated 4 months ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆30Updated 5 months ago
- Advanced Topics in Programming Languages, Penn CIS 670, Fall 2016☆41Updated last year
- Ltac2 tutorial☆39Updated last year
- Bedrock Bit Vector Library☆27Updated 6 months ago
- An automated theorem prover for intuitionistic propostional logic☆12Updated 4 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆50Updated this week
- Unification and type inference algorithms☆123Updated 9 years ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- Mechanizations of Type Theories☆26Updated 2 weeks ago
- Agda formalisation of second-order abstract syntax☆51Updated 2 years ago
- ☆21Updated 3 years ago
- A Unifying Cartesian Cubical Set Model☆33Updated 4 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated last year
- Implementation of Nuprl's type theory in Coq☆44Updated 3 years ago
- An itree-like data-structure to additionally support internal non-determinism☆13Updated this week