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
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated 2 years ago
- F-omega with interval kinds mechanized in Agda☆14Updated last year
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- A toy dependent typed language.☆36Updated this week
- A language-generic implementation of equality saturation in Haskell☆22Updated 7 years ago
- Formalization of type theory☆22Updated 4 years ago
- Work in progress on semi-simplicial types☆23Updated 3 years ago
- An implementation of a simple Neural network in Idris using category theory.☆24Updated last year
- Setoid type theory implementation☆38Updated 2 years ago
- Duo - A research language exploring duality in programming language design☆61Updated 2 years ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆23Updated 9 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- toy implementation of Hindley-Milner type system that prints out inference steps☆17Updated 3 months ago
- Collaborative work on reversible computing☆18Updated 3 years ago
- being a particular fragment of Haskell, extended to a proof system☆43Updated 2 months ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated 2 months ago
- Label dependent dependent session types☆16Updated last year
- being bits and pieces I'm inclined to leave lying around☆56Updated 3 weeks ago
- Efficient effect handlers based on Evidence Passing Semantics.☆33Updated 4 years ago
- A simple implementation of linear type theory☆39Updated 8 years ago
- # A simple variable binding library based on well-scoped indices and environments☆29Updated 3 months ago
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Updated 5 years ago