|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Halo: From Haskell to Logic through Denotational Semantics
If you have a question about this talk, please contact Bjarki Holm.
Even well-typed programs can go wrong, by encountering a pattern-match failure, or simply returning the wrong answer. And increasingly-popular response is to allow programmers to write contracts that express behavioural properties, such as crash-freedome of some useful post-condition. We study the static verification of such contracts. Our main contribution is a novel translation to first-order logic of both Haskell programs, and contracts written in Haskell, all justified by denotational semantics. This translation enables us to prove that functions satisfy their contracts using off-the-shelf first-order theorem provers.
This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
Other listsSignal Processing and Communications Lab Seminars Cambridge Carbon Nanotechnology Society Workshop in Microeconomics
Other talksThe Polis and the Res Publica: Two Arendtian Models of Political Violence Pattern formation in confined nematic systems: the interplay between geometry, anisotropy and singularities Measuring Ethnicity in the NHS TBC Stability and power sharing in microgrids Grand Rounds - 'To stage or not to Stage? That is the question!'