plclub / cis6700-23sp
CIS 6700, Spring 2023
☆15Updated last year
Related projects ⓘ
Alternatives and complementary repositories for cis6700-23sp
- a tutorial implementation on an elaborator of a dependently typed language with pruning☆22Updated 2 years ago
- A deterministic parser with fused lexing☆71Updated last year
- ♾️ A library for universe levels and universe polymorphism☆33Updated last week
- PL conference deadline countdowns☆52Updated 2 weeks ago
- a proof-of-concept programming language based on Call-by-push-value☆49Updated this week
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- A "implementation" of Girard's paradox in OCaml☆105Updated 9 years ago
- Formalization of CBPV extended with effect and coeffect tracking☆11Updated 2 months ago
- Deadlock freedom by type checking☆19Updated last year
- A pure type system implemented in OCaml☆77Updated 3 years 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
- A rosetta stone for metaprogramming in Coq, with different examples of tactics, plugins, etc implemented in different metaprogramming lan…☆17Updated 9 months ago
- high-performance cubical evaluation☆68Updated 4 months ago
- ☆23Updated last month
- Verified C programming in Agda☆16Updated 3 years ago
- Benchmarks for capture-avoiding substitution☆107Updated 2 years ago
- 🪆 A Staged Type Theory☆34Updated last year
- Fωμ type checker and compiler☆51Updated last year
- A bidirectional type checker☆57Updated 7 years ago
- A stepping debugger for Standard ML (SML)☆23Updated 9 months ago
- Mechanizations of Type Theories☆27Updated last week
- Playing with type systems☆46Updated 2 years ago
- an implementation of Observational Type Theory (OTT) and more☆26Updated 2 years ago
- Class instances for Coq inductive types with little boilerplate☆24Updated 7 months ago
- Strongly-typed System F in Haskell☆117Updated 2 years ago
- An interactive theorem prover based on lambda-tree syntax☆90Updated this week
- ☆35Updated 3 years ago
- A Coq library for parametric coinduction☆43Updated last month
- This aims to be the most pretentious implementation of stlc in existence☆60Updated 2 years ago