Lambda Calculus as a Workflow Model
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...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 22 |
|---|---|
| container_issue | |
| container_start_page | 15 |
| container_title | |
| container_volume | |
| creator | Kelly, P.M. Coddington, P.D. Wendelborn, A.L. |
| description | 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. |
| doi_str_mv | 10.1109/GPC.WORKSHOPS.2008.38 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4539319</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4539319</ieee_id><sourcerecordid>4539319</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-74b3ae6dd25c282c6a8b45d00d9a53b22d430ac701bb77fd1a2d224cd8fdeda73</originalsourceid><addsrcrecordid>eNotjE1Lw0AUABekoNb8AhECnhPffmTf7lGCtmJKSlvosbzN20A0JZJYxH-vRWFgDgMjxJ2EXErwD4t1me_rzet2Wa-3uQJwuXYXIvHoAK0vtET0M3F9Ll5pBLwUyTS9AYD0FqW1V-K-omNgSkvqm1N_mlL6Jd0P43vbD1_pauDY34hZS_0Uk3_Pxe75aVcus6pevJSPVdZ5-MzQBE3RMquiUU41llwwBQOwp0IHpdhooAZBhoDYsiTFSpmGXcuRCfVc3P5tuxjj4WPsjjR-H0yhvZZe_wCFDUEz</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Lambda Calculus as a Workflow Model</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Kelly, P.M. ; Coddington, P.D. ; Wendelborn, A.L.</creator><creatorcontrib>Kelly, P.M. ; Coddington, P.D. ; Wendelborn, A.L.</creatorcontrib><description>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.</description><identifier>ISBN: 9780769531779</identifier><identifier>ISBN: 0769531776</identifier><identifier>DOI: 10.1109/GPC.WORKSHOPS.2008.38</identifier><identifier>LCCN: 2008923707</identifier><language>eng</language><publisher>IEEE</publisher><subject>Application software ; Australia ; Calculus ; Computational modeling ; Computer languages ; Functional programming ; lambda calculus ; Logic programming ; Pervasive computing ; Switches ; Tree graphs ; workflow</subject><ispartof>2008 The 3rd International Conference on Grid and Pervasive Computing - Workshops, 2008, p.15-22</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4539319$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4539319$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Kelly, P.M.</creatorcontrib><creatorcontrib>Coddington, P.D.</creatorcontrib><creatorcontrib>Wendelborn, A.L.</creatorcontrib><title>Lambda Calculus as a Workflow Model</title><title>2008 The 3rd International Conference on Grid and Pervasive Computing - Workshops</title><addtitle>GPC-WORKSHOPS</addtitle><description>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.</description><subject>Application software</subject><subject>Australia</subject><subject>Calculus</subject><subject>Computational modeling</subject><subject>Computer languages</subject><subject>Functional programming</subject><subject>lambda calculus</subject><subject>Logic programming</subject><subject>Pervasive computing</subject><subject>Switches</subject><subject>Tree graphs</subject><subject>workflow</subject><isbn>9780769531779</isbn><isbn>0769531776</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2008</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotjE1Lw0AUABekoNb8AhECnhPffmTf7lGCtmJKSlvosbzN20A0JZJYxH-vRWFgDgMjxJ2EXErwD4t1me_rzet2Wa-3uQJwuXYXIvHoAK0vtET0M3F9Ll5pBLwUyTS9AYD0FqW1V-K-omNgSkvqm1N_mlL6Jd0P43vbD1_pauDY34hZS_0Uk3_Pxe75aVcus6pevJSPVdZ5-MzQBE3RMquiUU41llwwBQOwp0IHpdhooAZBhoDYsiTFSpmGXcuRCfVc3P5tuxjj4WPsjjR-H0yhvZZe_wCFDUEz</recordid><startdate>200805</startdate><enddate>200805</enddate><creator>Kelly, P.M.</creator><creator>Coddington, P.D.</creator><creator>Wendelborn, A.L.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200805</creationdate><title>Lambda Calculus as a Workflow Model</title><author>Kelly, P.M. ; Coddington, P.D. ; Wendelborn, A.L.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-74b3ae6dd25c282c6a8b45d00d9a53b22d430ac701bb77fd1a2d224cd8fdeda73</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Application software</topic><topic>Australia</topic><topic>Calculus</topic><topic>Computational modeling</topic><topic>Computer languages</topic><topic>Functional programming</topic><topic>lambda calculus</topic><topic>Logic programming</topic><topic>Pervasive computing</topic><topic>Switches</topic><topic>Tree graphs</topic><topic>workflow</topic><toplevel>online_resources</toplevel><creatorcontrib>Kelly, P.M.</creatorcontrib><creatorcontrib>Coddington, P.D.</creatorcontrib><creatorcontrib>Wendelborn, A.L.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Kelly, P.M.</au><au>Coddington, P.D.</au><au>Wendelborn, A.L.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Lambda Calculus as a Workflow Model</atitle><btitle>2008 The 3rd International Conference on Grid and Pervasive Computing - Workshops</btitle><stitle>GPC-WORKSHOPS</stitle><date>2008-05</date><risdate>2008</risdate><spage>15</spage><epage>22</epage><pages>15-22</pages><isbn>9780769531779</isbn><isbn>0769531776</isbn><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.</abstract><pub>IEEE</pub><doi>10.1109/GPC.WORKSHOPS.2008.38</doi><tpages>8</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISBN: 9780769531779 |
| ispartof | 2008 The 3rd International Conference on Grid and Pervasive Computing - Workshops, 2008, p.15-22 |
| issn | |
| language | eng |
| recordid | cdi_ieee_primary_4539319 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Application software Australia Calculus Computational modeling Computer languages Functional programming lambda calculus Logic programming Pervasive computing Switches Tree graphs workflow |
| title | Lambda Calculus as a Workflow Model |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-18T08%3A37%3A09IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Lambda%20Calculus%20as%20a%20Workflow%20Model&rft.btitle=2008%20The%203rd%20International%20Conference%20on%20Grid%20and%20Pervasive%20Computing%20-%20Workshops&rft.au=Kelly,%20P.M.&rft.date=2008-05&rft.spage=15&rft.epage=22&rft.pages=15-22&rft.isbn=9780769531779&rft.isbn_list=0769531776&rft_id=info:doi/10.1109/GPC.WORKSHOPS.2008.38&rft_dat=%3Cieee_6IE%3E4539319%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4539319&rfr_iscdi=true |