Functional Programming and Input/Output by Andrew D Gordon
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'.-
Logic Programming
-
Three-Dimensional Integrated Circuit Layout
-
Efficient Algorithms for Listing Combinatorial Structures
-
Specification and Proof in Real Time CSP
-
A Modular and Extensible Network Storage Architecture
-
Affine Analysis of Image Sequences
-
Modelling Auditory Processing and Organisation
-
Axiomatic Domain Theory in Categories of Partial Maps
-
Qualified Types
-
The Map-Building and Exploration Strategies of a Simple Sonar-Equipped Mobile Robot
-
A Compositional Approach to Performance Modelling
| SKU | Unavailable |
| ISBN 13 | 9780521070072 |
| ISBN 10 | 0521070074 |
| Title | Functional Programming and Input/Output |
| Author | Andrew D Gordon |
| Series | Distinguished Dissertations In Computer Science |
| Condition | Unavailable |
| Binding Type | Paperback |
| Publisher | Cambridge University Press |
| Year published | 2008-07-31 |
| Number of pages | 172 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |