paigenorth / oplssLinks
Resources for my Homotopy Type Theory course at OPLSS 2023
☆12Updated 2 years ago
Alternatives and similar repositories for oplss
Users that are interested in oplss are comparing it to the libraries listed below
Sorting:
- EPIT 2020 - Spring School on Homotopy Type Theory☆107Updated 4 years ago
- PL conference deadline countdowns☆61Updated 3 weeks ago
- Learn Lean 4 with PLFA proofs.☆83Updated 4 months ago
- Agda formalisation of the Introduction to Homotopy Type Theory☆125Updated 3 years ago
- Modeling and Proving in Computational Type Theory☆102Updated last week
- Coq formalizations and proofs of (data) structures and algorithms.☆46Updated 7 years ago
- Convert Haskell source code to Coq source code.☆86Updated last month
- being an operating system for typechecking processes☆128Updated 2 years ago
- ☆35Updated 10 months ago
- Communication between Coq and SAT/SMT solvers☆160Updated 10 months ago
- ☆53Updated this week
- A function definition package for Coq☆232Updated last month
- Lean 4 port of Iris, a higher-order concurrent separation logic framework☆112Updated last week
- Best of POPL (BOP) Reading Group Memoirs☆67Updated 3 years ago
- a proof-of-concept programming language based on call-by-push-value☆54Updated last week
- Benchmarking various normalization algorithms for the lambda calculus☆45Updated 2 years ago
- Coq code and exercises from the Coq'Art book [maintainers=@ybertot,@Casteran]☆123Updated 5 months ago
- Cartesian Cubical Type Theory☆71Updated 4 years ago
- ☆53Updated 5 months ago
- Benchmarks for capture-avoiding substitution☆119Updated 2 months ago
- A mechanisation of Wasm in Coq(Rocq)☆107Updated last month
- ☆233Updated last year
- The Penn Locally Nameless Metatheory Library☆75Updated 4 months ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated 6 months ago
- High level commands to declare a hierarchy based on packed classes☆100Updated 2 weeks ago
- Functional Programming in Lean☆101Updated this week
- A formalization of the textbook Elements of Set Theory☆59Updated 3 years ago
- This aims to be the most pretentious implementation of stlc in existence☆63Updated 3 years ago
- 十分钟魔法练习 in OCaml☆33Updated 3 years ago
- A library of mechanised undecidability proofs in the Coq proof assistant.☆119Updated 3 weeks ago