paigenorth / oplss
Resources for my Homotopy Type Theory course at OPLSS 2023
☆10Updated last year
Related projects ⓘ
Alternatives and complementary repositories for oplss
- PL conference deadline countdowns☆52Updated 2 weeks ago
- a proof-of-concept programming language based on Call-by-push-value☆49Updated this week
- The Penn Locally Nameless Metatheory Library☆71Updated 4 months ago
- Coq formalizations and proofs of (data) structures and algorithms.☆46Updated 6 years ago
- A mechanisation of Wasm in Coq☆95Updated 2 weeks ago
- Modeling and Proving in Computational Type Theory☆80Updated 4 months ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆44Updated 8 months ago
- Formalizations of Gradually Typed Languages in Agda☆54Updated last month
- ☆25Updated this week
- ☆38Updated this week
- a tutorial implementation on an elaborator of a dependently typed language with pruning☆22Updated 2 years ago
- Graph Theory [maintainers=@chdoc,@damien-pous]☆34Updated 4 months ago
- A simple Depdently-Typed Language for Research and Learning☆58Updated 8 years ago
- being an operating system for typechecking processes☆121Updated last year
- A prototypical dependently typed languages with sized types and variances☆104Updated 2 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆30Updated last month
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆52Updated 2 months ago
- Cartesian Cubical Type Theory☆70Updated 3 years ago
- EPIT 2020 - Spring School on Homotopy Type Theory☆103Updated 3 years ago
- Benchmarking various normalization algorithms for the lambda calculus☆43Updated 2 years ago
- ☆24Updated 4 years ago
- 十分钟魔法练习 in OCaml☆33Updated 2 years ago
- Towards changing things and see if it proofs☆59Updated 3 years ago
- This aims to be the most pretentious implementation of stlc in existence☆60Updated 2 years ago
- Unification and type inference algorithms☆123Updated 9 years ago
- ☆23Updated last month
- Functional Programming in Lean☆71Updated 6 months ago
- Best of POPL (BOP) Reading Group Memoirs☆67Updated 2 years ago
- Normalization by evaluation of simply typed combinators.☆26Updated 2 years ago
- An interactive theorem prover based on lambda-tree syntax☆90Updated this week