Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||Lambda calculus as a workflow model|
|Citation:||Proceedings of the Third International Conference on Grid and Pervasive Computing Workshop, 2008: pp.15-22|
|Conference Name:||International Conference on Grid and Pervasive Computing Workshop (3rd : 2008 : Kunming, China)|
|Peter M. Kelly, Paul D. Coddington, and Andrew L. Wendelborn|
|Abstract:||Data-oriented workflows are often used in scientific applications for executing a set of dependent tasks across multiple computers. We discuss how these can be modeled using lambda calculus, and how ideas from functional programming are applicable in the design of workflows. Such an approach avoids the restrictions often found in workflow languages, permitting the implementation of complex application logic and data manipulation. This paper explains why lambda calculus is an appropriate model for workflow representation, and how a suitably efficient implementation can provide a wide range of capabilities to developers. The presented approach also permits high-level workflow features to be implemented at user level, in terms of a small set of low-level primitives provided by the language implementation.|
|Appears in Collections:||Computer Science publications|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.