hkust-taco / superfLinks
Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.sigplan.org/details/POPL-2024-popl-research-papers/50)
☆15Updated last year
Alternatives and similar repositories for superf
Users that are interested in superf are comparing it to the libraries listed below
Sorting:
- A toy dependent typed language.☆29Updated last week
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 4 years ago
- being a particular fragment of Haskell, extended to a proof system☆32Updated 3 months ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 8 months ago
- 🪆 A Staged Type Theory☆35Updated last year
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- A formalization of System Fω in Agda☆17Updated 3 months ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- ☆17Updated last year
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- F-omega with interval kinds mechanized in Agda☆13Updated 10 months ago
- A simple supercompiler formally verified in Agda☆34Updated 8 years ago
- Toy implementation of Martin-Löf Type Theory☆28Updated 2 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- CS410 "Advanced Functional Programming"☆24Updated 2 weeks ago
- Benchmark repository of polyglot effect handler examples☆24Updated last month
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆36Updated last year
- ☆29Updated 2 years ago
- A simple implementation of XTT, "A cubical language for Bishop sets"☆26Updated 3 years ago
- A verified compiler for a lazy functional language☆36Updated 3 weeks ago
- Efficient effect handlers based on Evidence Passing Semantics.☆30Updated 4 years ago
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 4 years ago
- being an implementation of the calculus of constructions☆17Updated 2 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆26Updated 2 years ago