How Are Programs Found? Speculating about Language Ergonomics with Curry-Howard
Functional languages with strong static type systems have beneficial properties to help ensure program correctness and reliability. Surprisingly, their practical significance in applications is low relative to other languages lacking in those dimensions. In this paper, the programs-as-proofs analogy is taken seriously to gain speculative insights by analysis of creation habits in the proof-centric discipline of mathematics. Viewed in light of this analogy, a sampling of mathematicians’ attitudes towards formal proof suggests that the crucial role of intuition and experimentation in programming tasks may be under appreciated, hinting at a possible explanation of the challenges rigorously disciplined languages face in practical applications.
|Slides: How Are Programs Found? (how-are-programs-found-slides.pdf)||6.94MiB|
Wed 2 Nov Times are displayed in time zone: (GMT+02:00) Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
|13:30 - 14:20|
|DOI Pre-print File Attached|
|14:20 - 15:10|
James NobleVictoria University of Wellington, New Zealand, Andrew BlackPortland State University, Kim BrucePomona College, Michael HomerVictoria University of Wellington, Mark MillerGoogle Inc.DOI