Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore a groundbreaking conference presentation that introduces a pure functional calculus with destinations at its core, bridging the gap between destination passing and purely functional programming. Learn how this innovative approach subsumes existing similar systems while enabling the expression of programs previously thought impossible in pure languages. Discover the modal type system that manages both linearity and scopes, ensuring type safety through formal proofs developed with the Coq proof assistant. Examine how destination passing—traditionally viewed as imperative due to its use of out parameters—can be elegantly integrated into pure functional programming paradigms. Understand the theoretical foundations and practical implications of this linear λ-calculus for memory writes, including its potential applications and extensions. The presentation covers the formal mathematical framework, type safety guarantees, and demonstrates how this calculus can reason about correctness and extensions of related systems, offering new possibilities for purely functional programming languages.
