DocumentCode
1728534
Title
Lambda Calculus as a Workflow Model
Author
Kelly, Peter M. ; Coddington, Paul D. ; Wendelborn, Andrew L.
Author_Institution
Sch. of Comput. Sci., Univ. of Adelaide, Adelaide, SA
fYear
2008
Firstpage
15
Lastpage
22
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.
Keywords
functional programming; lambda calculus; complex application logic; data manipulation; data-oriented workflows; functional programming; lambda calculus; workflow model; Application software; Australia; Calculus; Computational modeling; Computer languages; Functional programming; Logic programming; Pervasive computing; Switches; Tree graphs; lambda calculus; workflow;
fLanguage
English
Publisher
ieee
Conference_Titel
Grid and Pervasive Computing Workshops, 2008. GPC Workshops '08. The 3rd International Conference on
Conference_Location
Kunming
Print_ISBN
978-0-7695-3177-9
Type
conf
DOI
10.1109/GPC.WORKSHOPS.2008.38
Filename
4539319
Link To Document