Proving Correctness of Programs with IO - A Paradigm Comparison

  • Authors:
  • Andrew Butterfield;Glenn Strong

  • Affiliations:
  • -;-

  • Venue:
  • IFL '02 Selected Papers from the 13th International Workshop on Implementation of Functional Languages
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper discusses reasoning about IO operations in Haskell, Clean and C and compares the effect on ease of reasoning of the different approaches taken to IO in these languages. An IO system model is built using VDM驴 and is used to prove a basic property of a program written in each of the three languages. We tentatively draw the conclusions that functional languages are easier to reason about and that Monads can make the reasoning process slightly more difficult, but note that much future work is needed.