Aᴘʀɪʟ 15, 2015 @ Bᴏsᴛᴏɴ Hᴀsᴋᴇʟʟ: http://www.meetup.com/Boston-Haskell/events/219653486/
Sʟɪᴅᴇs: http://tyconmismatch.com/bh_talk.pdf
"The last decade has seen many success stories for verified programming with dependent types, including the CompCert verified C compiler, verified libraries for concurrency and security, and machine-checked proofs of results like the four color theorem and the Feit-Thompson theorem. Despite these successes, dependently typed languages are rarely used for day-to-day programming tasks. In this talk, I’ll describe several limitations of modern dependently-typed languages that are holding them back from wider adoption for practical programming tasks. I’ll explain the historical and mathematical reasons for these limitations, and describe how we attempted to relax them in the design of the Zombie research language."

Materials

slides