Published January 21, 2026 | Version 1.0.0
Software Open

Bidirectional Type Checking for Existential Types with Higher-Rank Polymorphism (Artifact)

  • 1. ROR icon University of Toronto

Description

This project implements the algorithmic type system presented in the paper "Bidirectional Type Checking for Existential Types with Higher-Rank Polymorphism", which supports strong existential types, higher-rank polymorphism, and polymorphic subtyping. Most importantly, we support existential quantification and existential projections (as defined in the paper).

Files

implementation.zip

Files (138.0 MB)

Name Size Download all
md5:bbacfccd01794a968b97cbc69e2085be
31.3 MB Download
md5:ac8d32350d5ed0b6f2a173d38f1a0f0e
37.7 MB Download
md5:4aa6b19a662be2e0a9afb23c02124c13
69.0 MB Download
md5:c6d421344633d456cd518c736db51ae1
24.9 kB Preview Download

Additional details

Software

Programming language
Haskell