Copy this bookmark:



bookmark detail

The Great Theorem Prover Showdown • Hillel Wayne
I think that the appropriate paradigm is heavily dependent on context, but a lot of people speak in universals. I keep hearing that it’s easier to analyze pure functional code than mutable imperative code. But nobody gives rigorous arguments for this and nobody provides concrete examples. Nobody actually digs into why assignments and transitions are so much harder to reason about than pure functions and IO monads.
programming  types  proofs  formal-methods  dependent-types  fp  dafny  verification  theorem  proof  prover  imperative  functional 
april 2018 by kybernetikos
view in context