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 dependent type theory with user defined data types☆47Updated 4 years ago
- A toy dependent typed language.☆36Updated this week
- A compiler and runtime for normalizing the untyped λ-calculus☆32Updated 4 years ago
- Inline, type safe X86-64 assembly programming in Agda☆69Updated 7 years ago
- toy implementation of Hindley-Milner type system that prints out inference steps☆17Updated 2 months ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12Updated last year
- Duo - A research language exploring duality in programming language design☆61Updated 2 years ago
- a self-hosting lambda calculus compiler☆37Updated 9 months ago
- F-omega with interval kinds mechanized in Agda☆14Updated last year
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Collaborative work on reversible computing☆18Updated 3 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated 2 months ago
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- Setoid type theory implementation☆38Updated 2 years ago
- Changes and Pinafore projects. Pull requests not accepted.☆33Updated 3 weeks ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Updated 5 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"☆32Updated last year
- Graded Dependent Type systems☆25Updated 2 years ago
- ☆46Updated 4 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- being bits and pieces I'm inclined to leave lying around☆55Updated 6 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Updated 4 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 4 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 3 months ago
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- Formalization of type theory☆22Updated 4 years ago
- LL(1) parser generator verified in Coq☆48Updated 5 years ago
- Command-like expressions for real infinite-precision calculations☆55Updated 5 months ago