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☆46Updated 3 years ago
- A toy dependent typed language.☆30Updated this week
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- Collaborative work on reversible computing☆18Updated 2 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last year
- Duo - A research language exploring duality in programming language design☆57Updated 2 years ago
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆26Updated 3 years ago
- Setoid type theory implementation☆38Updated last year
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- An Agda library for programming with ternary relations☆17Updated 3 months ago
- ☆29Updated 2 years ago
- A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"☆30Updated 10 months ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- A verified compiler for a lazy functional language☆36Updated 3 weeks ago
- Inline, type safe X86-64 assembly programming in Agda☆70Updated 6 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆19Updated 2 months ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- Formalization of type theory☆22Updated 4 years ago
- Demo for dependent types + runtime code generation☆69Updated 4 months ago
- being a particular fragment of Haskell, extended to a proof system☆32Updated 4 months ago
- F-omega with interval kinds mechanized in Agda☆13Updated 11 months ago
- being bits and pieces I'm inclined to leave lying around☆52Updated 2 weeks ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- ♾️ A library for universe levels and universe polymorphism☆34Updated 7 months ago