hkust-taco / superf
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)
☆12Updated 3 months ago
Related projects: ⓘ
- a self-hosting lambda calculus compiler☆34Updated 3 years ago
- A dependent type theory with user defined data types☆46Updated 2 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- 🪆 A Staged Type Theory☆35Updated last year
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆23Updated 2 years ago
- Haskell implementation and Coq proof for an implicit polymorphic gradual type system.☆16Updated 4 years ago
- An implementation of a simple Neural network in Idris using category theory.☆22Updated 5 months ago
- A verified compiler for a lazy functional language☆31Updated this week
- A compiler and runtime for normalizing the untyped λ-calculus☆30Updated 2 years ago
- Graded Dependent Type systems☆23Updated last year
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 3 years ago
- Duo - A research language exploring duality in programming language design☆54Updated last year
- Work in progress on semi-simplicial types☆23Updated last year
- Toy implementation of Martin-Löf Type Theory☆27Updated 2 years ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆19Updated 10 months ago
- LL(1) parser generator verified in Coq☆44Updated 4 years ago
- Experimental functional language☆18Updated 2 years ago
- ♾️ A library for universe levels and universe polymorphism☆32Updated 3 months ago
- ☆33Updated 5 months ago
- Formalization of type theory☆22Updated 3 years ago
- A simple implementation of XTT, "A cubical language for Bishop sets"☆26Updated 2 years ago
- Rules for writing academic papers and checking them using LTex-ls and LanguageTool☆17Updated 2 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 2 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆55Updated 3 months ago
- A bottom-up approach to a verified implementation of MLTT☆13Updated this week
- BDD-based implementation of Datalog☆36Updated 4 years ago
- Yoneda lemma in every known language☆17Updated last year
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆30Updated 11 months ago
- A simple λProlog interpreter☆19Updated 2 years ago