Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Learn about a novel approach to typing Scheme programs through this 20-minute conference presentation that introduces "default typing" as an alternative to traditional static versus dynamic typing debates. Explore how this innovative system assigns plausibility-ranked type sets to program points, where rank 0 represents the programmer's expectations for normal behavior and higher ranks capture exceptional cases. Discover how the approach leverages Racket's macro-extensible type system and SMT-based constraint solving to verify programs against default assumptions, producing either efficient code with no runtime overhead or counterexamples highlighting violated assumptions. Examine the concept of conditional soundness, where type safety is guaranteed only when default assumptions hold at runtime, offering a middle ground between the rigidity of static typing and the flexibility of dynamic typing. Gain insights into this position paper's contribution to programming language theory and its potential impact on functional programming language design.
