Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Watch a 29-minute conference talk from YOW! 2017 where Associate Professor Barry Jay explores the paradox in computing foundations between lambda calculus and intensional computations. Discover how new intensional calculi offer greater expressiveness than lambda calculus through pattern matching and program querying capabilities. Learn about pattern calculus for handling higher-order functions and generic data structure queries, SF-calculus for analyzing programs through factoring, and lambda-SF calculus which adds native lambda-abstraction support. Explore how these theoretical advances have been implemented in the programming language bondi and their implications for future language development. Gain insights from Jay's expertise as a member of the School of Software & Centre for Artificial Intelligence at the University of Technology, Sydney, as he resolves fundamental questions about computational expressiveness and opens new possibilities for programming language design.
