Results 1  10
of
14
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 129 (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 30 (15 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.
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
"... ..."
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 7 (0 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.
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 5 (3 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
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
NATURAL DEDUCTION AND TERM ASSIGNMENT FOR COHEYTING ALGEBRAS IN POLARIZED BIINTUITIONISTIC LOGIC.
"... Abstract. We reconsider Rauszer’s biintuitionistic logic in the framework of the logic for pragmatics: every formula is regarded as expressing an act of assertion or conjecture, where conjunction and implication are assertive and subtraction and disjunction are conjectural. The resulting system of ..."
Abstract
 Add to MetaCart
Abstract. We reconsider Rauszer’s biintuitionistic logic in the framework of the logic for pragmatics: every formula is regarded as expressing an act of assertion or conjecture, where conjunction and implication are assertive and subtraction and disjunction are conjectural. The resulting system of polarized biintuitionistic logic (PBL) consists of two fragments, positive intuitionistic logic LJ⊃ ∩ and its dual LJ� � , extended with two negations partially internalizing the duality between LJ⊃ ∩ and LJ� �. Modal interpretations and Kripke’s semantics over bimodal preordered frames are considered and a Natural Deduction system PBN is sketched for the whole system. A stricter interpretation of the duality and a simpler natural deduction system is obtained when polarized biintuitionistic logic is interpreted over S4 rather than bimodal S4 (a logic called intuitionistic logic for pragmatics of assertions and conjectures ILPAC). The term assignment for the conjectural fragment LJ� � exhibits several features of calculi for concurrency, such as remote capture of variable and remote substitution. The duality is extended from formulas to proofs and it is shown that every computation in our calculus is isomorphic to a computation in the simply typed λcalculus. §1. Preface. We present a natural deduction system for propositional polarized biintuitionistic logic PBL, (a variant of) intuitionistic logic extended with a connective of subtraction A � B, read as “A but not B”, which is dual to implication. 1 The logic PBL is polarized in the sense that its expressions are regarded as expressing acts of assertion or of conjecture; implications and conjunctions are assertive, subtractions and disjunctions are conjectural. Assertions and conjectures are regarded as dual; moreover there are two negations, transforming assertions into conjectures and viceversa, in some sense internalizing the duality. Our notion of polarity isn’t just a technical device: it is rooted in an analysis of the structure of speechacts, following the viewpoint of the
The alphaepsilon calculus
"... Abstract. This paper is a brief intoduction to the αǫcalculus – a calculus of communication and duplication inspired by the structure of the classical quantifiers. We will summarize the results of a paper in preparation on connections between extensions of the calculus, sequent systems/proof nets f ..."
Abstract
 Add to MetaCart
Abstract. This paper is a brief intoduction to the αǫcalculus – a calculus of communication and duplication inspired by the structure of the classical quantifiers. We will summarize the results of a paper in preparation on connections between extensions of the calculus, sequent systems/proof nets for classical logic, and Herbrand’s theorem. 1
Classical Cutelimination in the πcalculus
"... We study the πcalculus, enriched with pairing, and define a notion of type assignment that uses the type constructor →. We encode the terms of the calculus X into this variant of π, and show that all reduction (cutelimination) and assignable types are preserved. Since X enjoys the CurryHoward iso ..."
Abstract
 Add to MetaCart
We study the πcalculus, enriched with pairing, and define a notion of type assignment that uses the type constructor →. We encode the terms 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 calculu LK, this implies that all proofs in LK have a representation in π. We then enrich the logic with the connector ¬, and show that this also can be represented in π.