Filters








427 Hits in 2.1 sec

Lambda Calculus as a Workflow Model

Peter M. Kelly, Paul D. Coddington, Andrew L. Wendelborn
2008 2008 The 3rd International Conference on Grid and Pervasive Computing - Workshops  
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.  ...  We discuss how these can be modeled using lambda calculus, and how ideas from functional programming are applicable in the design of workflows.  ...  Motivation There are several advantages to using lambda calculus as a model for expressing workflows.  ... 
doi:10.1109/gpc.workshops.2008.38 dblp:conf/gpc/KellyCW08 fatcat:usih6kyd6bhqjdsz3b5bbewcna

Lambda calculus as a workflow model

Peter M. Kelly, Paul D. Coddington, Andrew L. Wendelborn
2009 Concurrency and Computation  
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.  ...  We discuss how these can be modeled using lambda calculus, and how ideas from functional programming are applicable in the design of workflows.  ...  Motivation There are several advantages to using lambda calculus as a model for expressing workflows.  ... 
doi:10.1002/cpe.1448 fatcat:446xuff7lfei3aa2co6kw25hwi

Taverna Workflows: Syntax and Semantics

Daniele Turi, Paolo Missier, Carole Goble, David De Roure, Tom Oinn
2007 Third IEEE International Conference on e-Science and Grid Computing (e-Science 2007)  
Such formal foundation, which has so far been lacking, opens the way to the translation between Taverna workflows and other process models.  ...  This paper presents the formal syntax and the operational semantics of Taverna, a workflow management system with a large user base among the e-Science community.  ...  The computational lambda calculus is obtained by augmenting the lambda calculus with suitable monads [Wad90] to model real-life behaviour of functional programs.  ... 
doi:10.1109/e-science.2007.71 dblp:conf/eScience/TuriMGRO07 fatcat:jl26dqn6dnaqjnf2m2chdqso7m

Typetheoretic Approach to the Shimming Problem in Scientific Workflows

Andrey Kashlev, Shiyong Lu, Artem Chebotko
2015 IEEE Transactions on Services Computing  
To address these issues, we 1) reduce the shimming problem to a runtime coercion problem in the theory of type systems, 2) propose a scientific workflow model and define the notion of well-typed workflows  ...  , 5) implement our automated shimming technique, including all the proposed algorithms, lambda calculus, type system, and translation function in our VIEW system and present two case studies to validate  ...  WORKFLOW EXPRESSIONS We rely on simply typed lambda calculus [22] enriched with a set of primitive types as a formal framework to reason about the behavior of workflows.  ... 
doi:10.1109/tsc.2014.2347049 fatcat:xgoajq6pebfubgvbjcuvknk44a

The design and implementation of a workflow analysis tool

V. Curcin, M. Ghanem, Y. Guo
2010 Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences  
Motivated by the use of scientific workflows as a user-oriented mechanism for building executable scientific data integration and analysis applications, this article introduces a framework and a set of  ...  Our framework uses a number of formal modelling techniques to characterize the process and data behaviour of workflows and workflow components and to reason about their functional and execution properties  ...  Functional languages, such as lambda calculus, are designed to model these problems. -Functional equivalence/similarity.  ... 
doi:10.1098/rsta.2010.0157 pmid:20679131 fatcat:ecoqdce3zba3xmdt2jzcjjwn5u

Coercion Approach to the Shimming Problem in Scientific Workflows

Andrey Kashlev, Shiyong Lu, Artem Chebotko
2013 2013 IEEE International Conference on Services Computing  
To address these issues, we 1) reduce the shimming problem to a runtime coercion problem in the theory of type systems, 2) propose a scientific workflow model and define the notion of well-typed workflows  ...  workflows, thereby solving the shimming problem for any well-typed workflow, 5) implement our automated shimming technique, including all the proposed algorithms, lambda calculus, type system, and translation  ...  WORKFLOW EXPRESSIONS We rely on simply typed lambda calculus [2] enriched with a set of primitive types as a formal framework to reason about the behavior of workflows.  ... 
doi:10.1109/scc.2013.89 dblp:conf/IEEEscc/KashlevLC13 fatcat:fl34guxcufbinnpglc6t5vxu2i

Learning to Map Chinese Sentences to Logical Forms [chapter]

Zhihua Liao, Zili Zhang
2013 Lecture Notes in Computer Science  
To this end, a Chinese dataset with 880 (Chinese sentence, logical form) pairs was developed.  ...  Then, the unification-based learning (UBL) approach which induces a probabilistic Combinatory Categorial Grammar (CCG) with higher-order unification is applied to the task of learning.  ...  For demonstration a CCG grammar that includes a lexicon Λ with entries is shown as follows: It can model a wide range of language phenomena.  ... 
doi:10.1007/978-3-642-39787-5_38 fatcat:sy3tu6xavvfinbneacehyoiv7e

Issues about the Adoption of Formal Methods for Dependable Composition of Web Services [article]

Manuel Mazzara, Michele Ciavotta
2013 arXiv   pre-print
Nevertheless, we still try to propose some tentative answers based on our proposal for a composition calculus, which we hope can animate a proper discussion.  ...  Functional programming languages have a formal foundation in the lambda-calculus.  ...  The symmetry between lambda-calculus and the pi-calculus could suggest some analogies.  ... 
arXiv:1311.2535v1 fatcat:yko65m62nzgjdehpbqperntkxe

How to CPS Transform a Monad [chapter]

Annette Bieniusa, Peter Thiemann
2009 Lecture Notes in Computer Science  
For strict languages, such as our web programming language "Rinso" or Microsoft's F#, monadic expressions can help with structuring and composing computations.  ...  in a second step.  ...  The main contributions of this work are as follows. We define Λ M , a call-byvalue lambda calculus with explicit monadic constructs (a strict variant of the monadic metalanguage).  ... 
doi:10.1007/978-3-642-00722-4_19 fatcat:x2xsez4kvvhzlo25rzebzct2xu

Lachesis: Automatic Partitioning for UDF-Centric Analytics [article]

Jia Zou, Amitabh Das, Pratik Barhate, Arun Iyengar, Binhang Yuan, Dimitrije Jankov, Chris Jermaine
2021 arXiv   pre-print
We propose the Lachesis system, which represents UDF-centric workloads as workflows of analyzable and reusable sub-computations.  ...  Lachesis further adopts a deep reinforcement learning model to infer which sub-computations should be used to partition the underlying data.  ...  that applies a lambda calculus expression (i.e. composed of lambda abstractions and higher order composition functions) to a set of objects (like map); and join, aggregate, flatten, filter, etc..  ... 
arXiv:2006.16529v5 fatcat:nmxk56uzd5h4lajad6for6chry

Global Coordination Policies for Services

Vincenzo Ciancia, Gian Luigi Ferrari, Roberto Guanciale, Daniele Strollo
2010 Electronical Notes in Theoretical Computer Science  
In this paper, we introduce a formal methodology purposed to handle coordination among services from the perspective of a global observer, in the spirit of choreography models.  ...  Moreover, it features sessions as a mechanism to synchronize workflows of distributed and independent components.  ...  Our first contribution is the introduction of the NCP process calculus. As it happens in the π-calculus, NCP features scope extrusion as fundamental capability to model fresh resource generation.  ... 
doi:10.1016/j.entcs.2009.12.032 fatcat:pl7zkiyxy5bebddp62jpbuqgky

Wyvern

Ligia Nistor, Darya Kurilova, Stephanie Balzer, Benjamin Chung, Alex Potanin, Jonathan Aldrich
2013 Proceedings of the 5th Workshop on MechAnisms for SPEcialization, Generalization and inHerItance - MASPEGHI '13  
We present a foundational object-based language that we believe to be as close as one can get to simple typed lambda calculus while keeping objectorientation.  ...  We show how this foundational language can be translated to the typed lambda calculus via standard encodings.  ...  For example, in a pure object-oriented model, we can take the union of a set implemented as a list with a set implemented as a hash table.  ... 
doi:10.1145/2489828.2489830 fatcat:g3kicptupbhlnc4wxcywgm6ai4

Business Process Management — S-BPM a New Paradigm for Competitive Advantage? [chapter]

Robert Singer, Erwin Zinser
2010 Communications in Computer and Information Science  
approach as a valuable alternative to heretofore established procedure models.  ...  Based on well known facts from the area of business administration and strategy, we show why business process management as a whole needs to renew its paradigm, especially in the context of IT support.  ...  The terms discussed are lambda-7 and π-calculus.  ... 
doi:10.1007/978-3-642-15915-2_5 fatcat:4igda5givndujboqqqvjjwekei

Refactoring Long Running Transactions [chapter]

Gian Luigi Ferrari, Roberto Guanciale, Daniele Strollo, Emilio Tuosto
2009 Lecture Notes in Computer Science  
Sagas calculi have been proposed to specify distributed Long Running Transactions (LRT) and, in previous work, a subset of naive sagas has been encoded in the Signal Calculus (SC) to enable their use in  ...  Here, we promote a formal approach to the refactoring of LRT represented in SC so that distributed LRT designed in the Business Process Modelling Notation (BPMN) can be faithfully represented.  ...  Rule check (resp. lam) models the activation of check (resp. lambda) reactions, matching the session identifier (resp. receiving a session identifier as argument).  ... 
doi:10.1007/978-3-642-01364-5_8 fatcat:bvoveu6cavemnj6asquxqdhjxq

Checking Correctness of Transactional Behaviors [chapter]

Vincenzo Ciancia, Gian Luigi Ferrari, Roberto Guanciale, Daniele Strollo
2008 Lecture Notes in Computer Science  
The calculus is strongly motivated by the practical needs of Service-Oriented Computing, and there exists a Java implementation, called JSCL, with a graphical modeling framework.  ...  We show an example exploiting bisimilarity to prove the correctness of an SC model with respects to a transactional isolation requirement.  ...  Rules labeled check and lam model activation of check reactions, that exactly match the session identifier, and of lambda reactions, that receive a session identifier as argument.  ... 
doi:10.1007/978-3-540-68855-6_9 fatcat:nsm7a7aqdzcsletrdgjhxniaby
« Previous Showing results 1 — 15 out of 427 results