Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore a 15-minute conference presentation that introduces a novel approach to type qualifiers using Boolean algebras instead of traditional lattice-based systems. Learn how this research addresses the limitation of lattices in expressing exclusion by proposing Boolean algebras as a more practical and useful domain for type qualifiers. Discover the System F⧼:B calculus, which extends System F⧼: with type qualifiers over Boolean algebras and includes support for negation, qualifier polymorphism, and subqualification. Examine how this system serves as a design recipe for creating type and effect systems, specifically System F⧼:BE, which features effect polymorphism, subeffecting, and polymorphic effect exclusion. Gain insights into advanced type system design and implementation through this research presented by Edward Lee, Jonathan Lindegaard Starup, Ondřej Lhoták, and Magnus Madsen from the University of Waterloo and Aarhus University at the OOPSLA2 2025 conference. Access supplementary materials including the full research article and reusable artifacts that have been evaluated and reproduced by the academic community.
