Erratic Fudgets: A Semantic Theory for an Embedded Coordination Language

Erratic Fudgets: A Semantic Theory for an Embedded Coordination Language (2003)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Andrew Moran , David Sands , Magnus Carlsson

Venue:	SCIENCE OF COMPUTER PROGRAMMING
Citations:	20 - 3 self

Versions

Version History

Metadata Version 4

User correction supplied by jfernandez

Datum	Value	Source
TITLE	Erratic Fudgets: A Semantic Theory for an Embedded Coordination Language	user correction - Legacy Corrections
AUTHOR NAME	Andrew Moran	user correction
AUTHOR AFFIL	Department of Computing Science; Chalmers University of Technology and the University of Göteborg	user correction
AUTHOR ADDR	S-412 96 Göteborg, Sweden	user correction
AUTHOR NAME	David Sands	user correction
AUTHOR AFFIL	Department of Computing Science; Chalmers University of Technology and the University of Göteborg	user correction
AUTHOR ADDR	S-412 96 Göteborg, Sweden	user correction
AUTHOR NAME	Magnus Carlsson	user correction
AUTHOR AFFIL	Department of Computing Science; Chalmers University of Technology and the University of Göteborg	user correction
AUTHOR ADDR	S-412 96 Göteborg, Sweden	user correction
ABSTRACT	The powerful abstraction mechanisms of functional programming languages provide the means to develop domain-specific programming languages within the language itself. Typically, this is realised by designing a set of combinators (higher-order reusable programs) for an application area, and by constructing individual applications by combining and coordinating individual combinators. This paper is concerned with a successful example of such an embedded programming language, namely Fudgets, a library of combinators for building graphical user interfaces in the lazy functional language Haskell. The Fudget library has been used to build a number of substantial applications, including a web browser and a proof editor interface to a proof checker for constructive type theory. This paper develops a semantic theory for the non-deterministic stream processors that are at the heart of the Fudget concept. The interaction of two features of stream processors makes the development of such a semantic theory problematic: (i) the sharing of computation provided by the lazy evaluation mechanism of the underlying host language, and (ii) the addition of non-deterministic choice needed to handle the natural concurrency that reactive applications entail We demonstrate that this combination of features in a higher-order functional language can be tamed to provide a tractable semantic theory and induction principles suitable for reasoning about contextual equivalence of Fudgets.	user correction
YEAR	2003	user correction
VENUE	SCIENCE OF COMPUTER PROGRAMMING	user correction
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	99--135	user correction
VOLUME	46	user correction
NUMBER	1	user correction
CITATIONS	38 found	ParsCit 1.0