Results 1  10
of
24
A Survey of Automated Web Service Composition Methods
 In Proceedings of the First International Workshop on Semantic Web Services and Web Process Composition, SWSWPC 2004
, 2004
"... Abstract. In today’s Web, Web services are created and updated on the fly. It’s already beyond the human ability to analysis them and generate the composition plan manually. A number of approaches have been proposed to tackle that problem. Most of them are inspired by the researches in crossenterpr ..."
Abstract

Cited by 158 (1 self)
 Add to MetaCart
Abstract. In today’s Web, Web services are created and updated on the fly. It’s already beyond the human ability to analysis them and generate the composition plan manually. A number of approaches have been proposed to tackle that problem. Most of them are inspired by the researches in crossenterprise workflow and AI planning. This paper gives an overview of recent research efforts of automatic Web service composition both from the workflow and AI planning research community. 1
Strong Normalisation in the πCalculus
, 2001
"... We introduce a typed πcalculus where strong normalisation is ensured by typability. Strong normalisation is a useful property in many computational contexts, including distributed systems. In spite of its simplicity, our type discipline captures a wide class of converging namepassing interactive b ..."
Abstract

Cited by 32 (17 self)
 Add to MetaCart
We introduce a typed πcalculus where strong normalisation is ensured by typability. Strong normalisation is a useful property in many computational contexts, including distributed systems. In spite of its simplicity, our type discipline captures a wide class of converging namepassing interactive behaviour. The proof of strong normalisability combines methods from typed lcalculi and linear logic with processtheoretic reasoning. It is adaptable to systems involving state and other extensions. Strong normalisation is shown to have significant consequences, including finite axiomatisation of weak bisimilarity, a fully abstract embedding of the simplytyped lcalculus with products and sums and basic liveness in interaction.
2010): An exact correspondence between a typed picalculus and polarised proofnets
 Theor. Comput. Sci
"... polarised proofnets ..."
Propositions as Sessions
, 2012
"... Continuing a line of work by Abramsky (1994), by Bellin and Scott (1994), and by Caires and Pfenning (2010), among others, this paper presents CP, a calculus in which propositions of classical linear logic correspond to session types. Continuing a line of work by Honda (1993), by Honda, Kubo, and Va ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
Continuing a line of work by Abramsky (1994), by Bellin and Scott (1994), and by Caires and Pfenning (2010), among others, this paper presents CP, a calculus in which propositions of classical linear logic correspond to session types. Continuing a line of work by Honda (1993), by Honda, Kubo, and Vasconcelos (1998), and by Gay and Vasconcelos (2010), among others, this paper presents GV, a linear functional language with session types, and presents a translation from GV into CP. The translation formalises for the first time a connection between a standard presentation of session types and linear logic, and shows how a modification to the standard presentation yield a language free from deadlock, where deadlock freedom follows from the correspondence to linear logic. Note. Please read this paper in colour! The paper uses colour to highlight the relation of types to terms and source to target. 1.
From X to π; representing the classical sequent calculus
"... Abstract. We study the πcalculus, enriched with pairing and nonblocking input, and define a notion of type assignment that uses the type constructor →. We encode the circuits of the calculus X into this variant of π, and show that all reduction (cutelimination) and assignable types are preserved. ..."
Abstract

Cited by 12 (12 self)
 Add to MetaCart
Abstract. We study the πcalculus, enriched with pairing and nonblocking input, and define a notion of type assignment that uses the type constructor →. We encode the circuits of the calculus X into this variant of π, and show that all reduction (cutelimination) and assignable types are preserved. Since X enjoys the CurryHoward isomorphism for Gentzen’s calculus LK, this implies that all proofs in LK have a representation in π.
A logical interpretation of the λcalculus into the πcalculus, preserving spine reduction and types
, 2009
"... ..."
A TERM ASSIGNMENT FOR DUAL INTUITIONISTIC LOGIC.
"... Abstract. We study the prooftheory of coHeyting algebras and present a calculus of continuations typed in the disjunctive–subtractive fragment of dual intuitionistic logic. We give a singleassumption multipleconclusions Natural Deduction system NJ � � for this logic: unlike the bestknown treatm ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
Abstract. We study the prooftheory of coHeyting algebras and present a calculus of continuations typed in the disjunctive–subtractive fragment of dual intuitionistic logic. We give a singleassumption multipleconclusions Natural Deduction system NJ � � for this logic: unlike the bestknown treatments of multipleconclusion systems (e.g., Parigot’s λ−µ calculus, or Urban and Bierman’s termcalculus) here the termassignment is distributed to all conclusions, and exhibits several features of calculi for concurrency, such as remote capture of variable and remote substitution. The present construction can be regarded as the construction of a free coCartesian
The Term Graph Programming System HOPS
 Tool Support for System Specification, Development and Verification, Advances in Computing Science
, 1999
"... this paper have been generated from the latest version of HOPS. ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
this paper have been generated from the latest version of HOPS.
Implicative Logic based encoding of the λcalculus into the πcalculus
, 2010
"... We study an outputbased encoding of the λcalculus with explicit substitution into the synchronous πcalculus – enriched with pairing – that has its origin in mathematical logic, and show that this encoding respects reduction. We will define the notion of (explicit) spine reductionwhich encompasse ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We study an outputbased encoding of the λcalculus with explicit substitution into the synchronous πcalculus – enriched with pairing – that has its origin in mathematical logic, and show that this encoding respects reduction. We will define the notion of (explicit) spine reductionwhich encompasses (explicit) lazy reduction and show that the encoding fully encodes this reduction in that termsubstitution as well as each single reduction step are modelled up to contextual similarity. We show that all the main properties (soundness, completeness, and adequacy) hold for these four notions of reduction, as well as that termination is preserved. We then define a notion of type assignment for the πcalculus that uses the type constructor→, and show that all Curry types assignable to λterms are preserved by the encoding. Key words: the λcalculus, the πcalculus, intuitionistic logic, classical logic, encoding, type assignment
Acyclic Solos and Differential Interaction Nets ∗
, 2008
"... We present a restriction of the solos calculus which is stable under reduction and expressive enough to contain an encoding of the picalculus. As a consequence, it is shown that equalizing names that are already equal is not required by the encoding of the picalculus. In particular, the induced so ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We present a restriction of the solos calculus which is stable under reduction and expressive enough to contain an encoding of the picalculus. As a consequence, it is shown that equalizing names that are already equal is not required by the encoding of the picalculus. In particular, the induced solo diagrams bear an acyclicity property that induces a faithful encoding into differential interaction nets. This gives a (new) proof that differential interaction nets are expressive enough to contain an encoding of the picalculus. All this is worked out in the case of finitary (replication free) systems without sum, match nor mismatch.