Results 11  20
of
20
Typed HigherOrder Concurrent Linear Logic Programming
, 1994
"... We propose a typed, higherorder, concurrent linear logic programming called higherorder ACL, which uniformly integrates a variety of mechanisms for concurrent computation based on asynchronous message passing. Higherorder ACL is based on a proof search paradigm according to the principle, proofs ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
We propose a typed, higherorder, concurrent linear logic programming called higherorder ACL, which uniformly integrates a variety of mechanisms for concurrent computation based on asynchronous message passing. Higherorder ACL is based on a proof search paradigm according to the principle, proofs as computations, formulas as processes in linear logic. In higherorder ACL, processes as well as functions, and other values can be communicated via messages, which provides high modularity of concurrent programs. Higherorder ACL can be viewed as an asynchronous counterpart of Milner's higherorder, polyadic ßcalculus. Moreover, higherorder ACL is equipped with an elegant MLstyle type system that ensures (1) well typed programs can never cause type mismatch errors, and (2) there is a type inference algorithm which computes a most general typing for an untyped term. We also demonstrate a power of higherorder ACL by showing several examples of "higherorder concurrent programming." ANY O...
Constraint Logic Programming in the Sequent Calculus
 Logic Programming and Automated Reasoning
, 1994
"... . In this paper, we are developing a new logical semantics of CLP. It is shown that CLP is based on an amalgamated logic embedding the entailment relation of constraints into a fragment of intuitionistic logic. Constrained SLD resolution corresponds to a complete proof search in the amalgamated logi ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
. In this paper, we are developing a new logical semantics of CLP. It is shown that CLP is based on an amalgamated logic embedding the entailment relation of constraints into a fragment of intuitionistic logic. Constrained SLD resolution corresponds to a complete proof search in the amalgamated logic. The framework provides not only the logical account on the definitional semantics towards CLP but also a general way to integrate constraints into various logic programming systems. 1 Introduction Constraint logic programming has recently attracted much research actively. Intuitively, constraint logic programming languages are designed by replacing unification with constraint solving over a computational domain. Therefore, logic programming can be pursued over any intended domain of discourse. Many CLP languages has been designed [JL87, Col87] and implemented [JL87, Col87]. Their computational domains include linear arithmetic[JL87], boolean algebra [KS89] and finite sets [MHS88]. Since ...
Phase Model Checking for some Linear Logic
 Proceedings of the Second International Workshop of the Implementation of Logics, Havana, Cuba, MPII2001 2006
, 2001
"... Building upon previous work in the logical semantics of linear concurrent constraint programming languages (LCC), an example of linear logic based calculus, we design an original phase model checking method for proving safety properties of programs. We describe our implementation of the phase model ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Building upon previous work in the logical semantics of linear concurrent constraint programming languages (LCC), an example of linear logic based calculus, we design an original phase model checking method for proving safety properties of programs. We describe our implementation of the phase model checker using constraint programming techniques and provide first experimental results.
Linear Concurrent Constraint Programming Over Reals
, 1998
"... . We introduce a constraint system LC that handles arithmetic constraints over reals within the linear concurrent constraint programming (lcc) framework. This approach provides us with a general, extensible foundation for linear programming algorithm design that comes with a (linear) logical semant ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. We introduce a constraint system LC that handles arithmetic constraints over reals within the linear concurrent constraint programming (lcc) framework. This approach provides us with a general, extensible foundation for linear programming algorithm design that comes with a (linear) logical semantics. In particular, it allows us to build a `glassbox' version of the (constraint solver) simplex algorithm by defining (monotone) cc ask and tell agents over a higherlevel constraint system as lcc(LC) programs. We illustrate at the same time the use of the lccframework as a nontrivial concurrent algorithm specification tool. 1 Introduction Constraintbased programming languages are based on a functional separation between a program that successively generates pieces of partial information called constraints, and a constraint solver that collects, combines, simplifies and detects inconsistencies between these constraints. Initially, constraint solvers were monolithic programs written in...
LFG qua concurrent constraint programming
"... ions j mm  Applications j j  Constants j x  Lambda variables j X  Variables (Resources) q ::= r ; m Primitive Resource (1.7) The only "constraint" related to semantic projections is the primitive resource r ; m. Unlike constraints discussed above, such an atom is not allowed to b ..."
Abstract
 Add to MetaCart
ions j mm  Applications j j  Constants j x  Lambda variables j X  Variables (Resources) q ::= r ; m Primitive Resource (1.7) The only "constraint" related to semantic projections is the primitive resource r ; m. Unlike constraints discussed above, such an atom is not allowed to be replicated freely; it is a "linear" atom, discussed below. Such an atom entails only itself; that is r ; m ` a iff a j r ; m. 3 Because of the use of universal quantification (discussed below), unification problems of the form m = m 0 may arise, requiring higherorder unification to be performed. Higherorder unification is undecidable (?). However, as in all 3 Two lambda terms are considered equivalent if they are interconvertible using ff\Gamma; fi \Gamma and jconversion. Concurrent constraint programming 15 the previous examples, the use of higherorder unification in LFG is extremely limited. In essence, it is used only for "patternmatching" against linear terms (terms with...
Expressiveness and Complexity of Concurrent Constraint Programming: a Finite Model Theoretic Approach
"... We study the expressiveness and complexity of concurrent constraint programming languages over finite domains. We establish strong connections between these languages and query languages in finite model theory. The bridge to finite model theory yields new (and sometimes quite surprising) results on ..."
Abstract
 Add to MetaCart
We study the expressiveness and complexity of concurrent constraint programming languages over finite domains. We establish strong connections between these languages and query languages in finite model theory. The bridge to finite model theory yields new (and sometimes quite surprising) results on the expressiveness and complexity of concurrent constraint languages, including several powerful normal forms. These results provide new insight into the impact of various semantics and features of concurrent constraint programming languages on their expressiveness and complexity. 1 Introduction Concurrent constraint programming (CC) [Sar87] emerged as a combination of concurrent logic programming and constraint logic programming (CLP) [JL87]. The basic idea is the one of a set of agents communicating through a shared store of constraints, that are logical formulas on the unknowns of the problem. Each agent can either write a constraint to the store (tell operation), or synchronize with oth...
The Linear Logic Semantics of Concurrent Constraint Programs Revisited
"... Building upon previous work on the logical semantics of concurrent constraint programming languages (CC) in linear logic, we show that a new translation of CC expressions by logical formulae makes it possible to characterize both non entailmentclosed properties of CC computations in linear logic, a ..."
Abstract
 Add to MetaCart
Building upon previous work on the logical semantics of concurrent constraint programming languages (CC) in linear logic, we show that a new translation of CC expressions by logical formulae makes it possible to characterize both non entailmentclosed properties of CC computations in linear logic, and the set of suspensions of a CC process in non commutative logic with no restriction. These advances are applied to the design of an original phase model checking method for proving safety properties of CC processes. We describe our implementation of the phase model checker using constraint programming techniques and provide first experimental results.
A Precise Logical Semantics of Concurrent Constraint Programs
"... We study the relation between Concurrent Constraint Programming languages (CC) and Linear Logic. CC processes have a direct translation into LL formulae which characterizes the entailmentclosed observable properties of CC computations as provable formulae in LL. The problem of characterizing non en ..."
Abstract
 Add to MetaCart
We study the relation between Concurrent Constraint Programming languages (CC) and Linear Logic. CC processes have a direct translation into LL formulae which characterizes the entailmentclosed observable properties of CC computations as provable formulae in LL. The problem of characterizing non entailmentclosed observables is that the notion of entailment in logic is richer than the operational semantics of CC agents, in particular for the existential quanti er modeling the hiding operator. We solve this problem with a more complex translation of the original constraint system and of the hiding operator in LL. As a result we obtain exact characterizations of the set of CC successes and accessible stores in LL, and a perfect characterization of CC suspensions in the NonCommutative logic of Ruet and Abrusci.
Designing a Nonmonotonic Soft Concurrent Constraint Language for SLA Management
"... Abstract. We present an extension of the Soft Concurrent Constraint language to allow the nonmonotonic evolution of the constraint store. To accomplish this, we introduce some new operations: the retract(c) reduces the current store by c, the updateX(c) transactionally relaxes all the constraints of ..."
Abstract
 Add to MetaCart
Abstract. We present an extension of the Soft Concurrent Constraint language to allow the nonmonotonic evolution of the constraint store. To accomplish this, we introduce some new operations: the retract(c) reduces the current store by c, the updateX(c) transactionally relaxes all the constraints of the store that deal with the variables in X set, and then adds a constraint c (usually with support = X); the nask(c) tests if c is not entailed by the store. We present this framework as a possible solution to the management of resources (e.g. web services and network resource allocation) that need a given Quality of Service (QoS). The QoS requirements of all the parties should converge, through a negotiation process, on a formal agreement defined as the Service Level Agreement, which specifies the contract that must be enforced. The main advantage is to have a preference (or cost) measure directly embedded in the language, and to have a highly flexible and parametric abstraction. 1
DOI: 10.1109/LICS.2006.39 On the Expressiveness of Linearity vs Persistence in the Asychronous PiCalculus
"... Several other frameworks using a persistent store can be found in the context of calculi for analyzing and describing security protocols. For instance, Crazzolara and Winskel’s SPL [7], the Spi Calculus variants by Fiore and Abadi [9] and by Amadio et al [1], and the calculus of Boreale and Buscemi ..."
Abstract
 Add to MetaCart
Several other frameworks using a persistent store can be found in the context of calculi for analyzing and describing security protocols. For instance, Crazzolara and Winskel’s SPL [7], the Spi Calculus variants by Fiore and Abadi [9] and by Amadio et al [1], and the calculus of Boreale and Buscemi [4] are all operationally defined in terms of configurations containing items of information (messages) which cannot be consumed during evolution. The idea is that the persistent store models an attacker’s ability to see and remember every message that has been in transit. A legitimate question is whether such persistence restricts the systems that we can specify, model or reason about in the framework. For instance, whether CCP can specify the kind of systems that can be described in Linear CCP. Analogously, in the context of the abovementioned