An Operational Semantics for I/O in a Lazy Functional Language

An Operational Semantics for I/O in a Lazy Functional Language (1993)

Cached

Download Links

[ftp.cl.cam.ac.uk]

Other Repositories/Bibliography

DBLP

by Andrew D. Gordon

Venue:	in Proc Functional Programming Languages and Computer Architecture
Citations:	9 - 3 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	An Operational Semantics for I/O in a Lazy Functional Language	user correction - Legacy Corrections
AUTHOR NAME	Andrew D. Gordon	SVM HeaderParse 0.1
AUTHOR AFFIL	Programming Methodology Group,; Department of Computer Science,; Chalmers University of Technology,	SVM HeaderParse 0.2
AUTHOR ADDR	412 96 Gothenburg, Sweden.	SVM HeaderParse 0.1
ABSTRACT	I/O mechanisms are needed if functional languages are to be suitable for general purpose programming and several implementations exist. But little is known about semantic methods for specifying and proving properties of lazy functional programs engaged in I/O. As a step towards formal methods of reasoning about realistic I/O we investigate three widely implemented mechanisms in the setting of teletype I/O: synchronised-stream (primitive in Haskell), continuationpassing (derived in Haskell) and Landin-stream I/O (where programs map an input stream to an output stream of characters) . Using methods from Milner's CCS we give a labelled transition semantics for the three mechanisms. We adopt bisimulation equivalence as equality on programs engaged in I/O and give functions to map between the three kinds of I/O. The main result is the first formal proof of semantic equivalence of the three mechanisms, generalising an informal argument of the Haskell committee. 1 Introduction and motivation...	user correction - Legacy Corrections
YEAR	1993	INFERENCE
VENUE	in Proc Functional Programming Languages and Computer Architecture	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	136--145	INFERENCE
CITATIONS	34 found	ParsCit 1.0