Workflow representation and runtime based on lazy functional streams

Authors:
Matthew J. Sottile;Geoffrey C. Hulette;Allen D. Malony
Affiliations:
University of Oregon, Eugene, OR;University of Oregon, Eugene, OR;University of Oregon, Eugene, OR
Venue:
Proceedings of the 4th Workshop on Workflows in Support of Large-Scale Science
Year:
2009

Citing 9
Cited 0

Generalising monads to arrows

Science of Computer Programming - Special issue on mathematics of program construction
Workflow Patterns

Distributed and Parallel Databases
The Sisal Model of Functional Programming and its Implementation

PAS '97 Proceedings of the 2nd AIZU International Symposium on Parallel Algorithms / Architecture Synthesis
Kepler: An Extensible System for Design and Execution of Scientific Workflows

SSDBM '04 Proceedings of the 16th International Conference on Scientific and Statistical Database Management
Rule-based workflow management for bioinformatics

The VLDB Journal — The International Journal on Very Large Data Bases
Taverna: a tool for the composition and enactment of bioinformatics workflows

Bioinformatics
Scientific workflow management and the Kepler system: Research Articles

Concurrency and Computation: Practice & Experience - Workflow in Grid Systems
Taverna Workflows: Syntax and Semantics

E-SCIENCE '07 Proceedings of the Third IEEE International Conference on e-Science and Grid Computing
WOOL: A Workflow Programming Language

ESCIENCE '08 Proceedings of the 2008 Fourth IEEE International Conference on eScience

Quantified Score

Hi-index	0.00

Visualization

Abstract

Workflows are a successful model for building both distributed and tightly-coupled programs based on a dataflow-oriented coordination of computations. Multiple programming languages have been proposed to represent workflow-based programs in the past. In this paper, we discuss a representation of workflows based on lazy functional streams implemented in the strongly typed language Haskell. Our intent is to demonstrate that streams are an expressive intermediate representation for higher-level workflow languages. By embedding our stream-based workflow representation in a language such as Haskell, we also gain with minimal effort the strong type system provided by the base language, the rich library of built-in functional primitives, and most recently, rich support for managing concurrency at the language level.