• Cite Icon3
  • https://doi.org/10.1109/gpc.workshops.2008.38Copy DOI Icon

Lambda Calculus as a Workflow Model

  • May 1, 2008
  • Peter M Kelly +2 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
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.

Similar Papers
  • Conference Article
  • Citations1

On the design of a functional programming framework

  • Oct 14, 1996
  • Z Budimac +2
  • Research Article
  • Citations34

Safety of Nöcker's strictness analysis

  • Nov 08, 2007
  • Journal of Functional Programming
  • Manfred Schmidt-Schauss +2
  • Single Report

Functional Programming in Computer Science

  • Jan 19, 2016
  • Loren James Anderson +1
  • Book Chapter
  • Citations4

A Parallel Intermediate Representation based on Lambda Expressions

  • Jan 01, 1991
  • Timothy A. Budd
  • Single Book
  • Citations171

Two-Level Functional Languages

  • Jul 16, 1992
  • Flemming Nielson +1
  • Conference Article
  • Citations38

Automatic time-bound analysis for a higher-order language

  • Jan 14, 2002
  • Gustavo Gómez +1
  • Research Article
  • Citations16

Computation semantics of the functional scientific workflow language Cuneiform

  • Jan 01, 2017
  • Journal of Functional Programming
  • Jörgen Brandt +2
  • Book Chapter
  • Citations15

Specification and Verification of a Formal System for Structurally Recursive Functions

  • Jan 01, 2000
  • Andreas Abel
  • Research Article

Teaching Foundations of Computation and Deduction Through Literate Functional Programming and Type Theory Formalization

  • Jan 01, 2016
  • DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
  • Gérard Huet
  • PDF
  • Research Article
  • Citations10

The Verse Calculus: A Core Calculus for Deterministic Functional Logic Programming

  • Aug 30, 2023
  • Proceedings of the ACM on Programming Languages
  • Lennart Augustsson +7
  • Book Chapter
  • Citations7

The PSG system: From formal language definitions to interactive programming environments

  • Jan 01, 1988
  • Rolf Bahlke +1
  • Book Chapter
  • Citations48

Building Scientific Workflow with Taverna and BPEL: A Comparative Study in caGrid

  • Jan 01, 2009
  • Wei Tan +3
  • Research Article

Comments on “distributed computation by graph reduction” by r. m. keller: Response to distributed computation by graph reduction

  • Dec 01, 1985
  • Systems Research
  • Lee W Hoevel
  • Research Article

Power of Java Streams and its Best Practice

  • Nov 05, 2021
  • International Journal of Science and Research (IJSR)
  • Priyanka Gowda Ashwath Narayana
  • PDF
  • Research Article
  • Citations5

Two Medoid-Based Algorithms for Clustering Sets

  • Jul 20, 2023
  • Algorithms
  • Libero Nigro +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.