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 this week
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- A dependent type theory with user defined data types☆46Updated 3 years ago
- 🪆 A Staged Type Theory☆35Updated last year
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 9 months ago
- ☆17Updated last year
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- A simple implementation of XTT, "A cubical language for Bishop sets"☆27Updated 3 years ago
- A formalization of System Fω in Agda☆17Updated 4 months ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- being a particular fragment of Haskell, extended to a proof system☆32Updated 3 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Category theory formalized in cubical agda☆21Updated 5 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- ☆29Updated 3 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- ☆29Updated 2 years ago
- Toy implementation of Martin-Löf Type Theory☆28Updated 2 years ago
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- ☆12Updated 4 years ago
- Setoid type theory implementation☆38Updated last year
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆26Updated 3 years ago
- A formalization of the theory behind the mugen library☆19Updated last year
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- being bits and pieces I'm inclined to leave lying around☆50Updated 6 months ago
- A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"☆30Updated 10 months ago
- Linearizability Hoare Logic☆14Updated 3 months ago