menu
{ "item_title" : "Functional Programming and Input/Output", "item_author" : [" Andrew D. Gordon "], "item_description" : "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, for the first time, 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 also 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. Graduate students and researchers will gain much from reading this book.", "item_img_path" : "https://covers1.booksamillion.com/covers/bam/0/52/107/007/0521070074_b.jpg", "price_data" : { "retail_price" : "53.00", "online_price" : "53.00", "our_price" : "53.00", "club_price" : "53.00", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Functional Programming and Input/Output|Andrew D. Gordon

Functional Programming and Input/Output

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

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, for the first time, 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 also 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." Graduate students and researchers will gain much from reading this book.

This item is Non-Returnable

Details

  • ISBN-13: 9780521070072
  • ISBN-10: 0521070074
  • Publisher: Cambridge University Press
  • Publish Date: July 2008
  • Dimensions: 9.61 x 6.69 x 0.37 inches
  • Shipping Weight: 0.62 pounds
  • Page Count: 172

Related Categories

You May Also Like...

    1

BAM Customer Reviews