Publication
Type-Level Programming with Match Types
Publications associées (121)
Formal Foundations of Capture Tracking
Aleksander Slawomir Boruch-Gruszecki
Type systems are a device for verifying properties of programs without running them. Many programming languages used in the industry have always had a type system, while others were initially created without a type system and later adopted one, when the ad ...
EPFL2024When Subtyping Constraints Liberate A Novel Type Inference Approach for First-Class Polymorphism
Lionel Emile Vincent Parreaux, Aleksander Slawomir Boruch-Gruszecki
Type inference in the presence of first-class or "impredicative" second-order polymorphism a la System F has been an active research area for several decades, with original works dating back to the end of the 80s. Yet, until now many basic problems remain ...
Assoc Computing Machinery2024Capturing Types
Martin Odersky, Aleksander Slawomir Boruch-Gruszecki, Ondrej Lhoták
Type systems usually characterize the shape of values but not their free variables. However, many desirable safety properties could be guaranteed if one knew the free variables captured by values. We describe CC
New York2023Dynamic Linkers Are the Narrow Waist of Operating Systems
Adrien Ghosn, Charly Nicolas Lucien Castes
While software applications, programming languages, and hardware have changed, operating systems have not. Widely-used commodity operating systems are still modeled after the ones designed in the seventies. The accumulated burden of backward compatibility ...
Association for Computing Machinery2023A case for DOT: Theoretical Foundations for Objects with Pattern Matching and GADT-Style Reasoning
Yichen Xu, Lionel Emile Vincent Parreaux, Aleksander Slawomir Boruch-Gruszecki
Many programming languages in the OO tradition now support pattern matching in some form. Historical examples include Scala and Ceylon, with the more recent additions of Java, Kotlin, TypeScript, and Flow. But pattern matching on generic class hierarchies ...
New York2022Type-preserving compilation of (most of) FGJ into DOT
Guillaume André Fradji Martres
The Dependent Object Type (DOT) calculus was designed to put Scala on a sound basis, but while DOT relies on structural subtyping, Scala is a fundamentally class-based language. This impedance mismatch means that a proof of DOT soundness by itself is not e ...
2022