A common attraction to functional programming is the ease with which proofs can be given of program properties. A common disappointment with functional programming is the difficulty of expressing input/output (I/O), while at the same time being able to verify programs. Here, the author shows how a theory of functional programming can be smoothly extended to admit both an operational semantics for functional I/O and verification of programs engaged in I/O. He obtains operational semantics for the three most widely implemented I/O mechanisms for lazy languages, and proves that the three are equivalent in expressive power. He develops semantics for a form of monadic I/O and verifies a simple programming example. These theories of functional I/O are based on an entirely operational theory of functional programming, developed using Abramsky's 'applicative bisimulation'.

Extends functional programming to solve I/O problems, while retaining usual verification features.

Book Information
ISBN 9780521070072
Author Andrew D. Gordon
Format Paperback
Page Count 172
Imprint Cambridge University Press
Publisher Cambridge University Press
Weight(grams) 290g
Dimensions(mm) 245mm * 175mm * 10mm