A Bowtie for a Beast: Overloading, Eta Expansion, and Extensible Data Types in F⋈

Abstract

<p>The typed <em>merge operator</em> offers the promise of a compositional style of statically-typed programming in which solutions to the expression problem arise naturally. This approach, dubbed <em>compositional programming</em>, has recently been demonstrated by Zhang et al. </p><p>Unfortunately, the merge operator is an unwieldy beast. Merging values from overlapping types may be ambiguous, so <em>disjointness relations</em> have been introduced to rule out undesired nondeterminism and obtain a well-behaved semantics. Past type systems using a disjoint merge operator rely on intersection types, but extending such systems to include union types or overloaded functions is problematic: naively adding either reintroduces ambiguity. In a nutshell: the elimination forms of unions and overloaded functions require values to be distinguishable by case analysis, but the merge operator can create exotic values that violate that requirement. </p><p>This paper presents <em>F</em>⋈, a core language that demonstrates how unions, intersections, and overloading can all coexist with a tame merge operator. The key is an underlying design principle that states that any two inhabited types can support either the deterministic merging of their values, or the ability to distinguish their values, but never both. To realize this invariant, we decompose previously studied notions of disjointness into two new, dual relations that permit the operation that best suits each pair of types. This duality respects the polarization of the type structure, yielding an expressive language that we prove to be both type safe and deterministic.</p>