Results 1  10
of
752
A calculus of mobile processes, I
, 1992
"... We present the acalculus, a calculus of communicating systems in which one can naturally express processes which have changing structure. Not only may the component agents of a system be arbitrarily linked, but a communication between neighbours may carry information which changes that linkage. The ..."
Abstract

Cited by 1184 (31 self)
 Add to MetaCart
We present the acalculus, a calculus of communicating systems in which one can naturally express processes which have changing structure. Not only may the component agents of a system be arbitrarily linked, but a communication between neighbours may carry information which changes that linkage
A weak calculus with explicit operators for pattern matching and substitution
 In Tison [Tis02
, 2002
"... Abstract. In this paper we propose a Weak Lambda Calculus called λPw having explicit operators for Pattern Matching and Substitution. This formalism is able to specify functions defined by cases via pattern matching constructors as done by most modern functional programming languages such as OCAML. ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Abstract. In this paper we propose a Weak Lambda Calculus called λPw having explicit operators for Pattern Matching and Substitution. This formalism is able to specify functions defined by cases via pattern matching constructors as done by most modern functional programming languages such as OCAML
Symbolic Model Checking: 10^20 States and Beyond
, 1992
"... Many different methods have been devised for automatically verifying finite state systems by examining stategraph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number of st ..."
Abstract

Cited by 758 (41 self)
 Add to MetaCart
, strong and weak observational equivalence of finite transition systems, and language containment for finite wautomata. The fixed point computations for each decision procedure are sometimes complex. but can be concisely expressed in the MuCalculus. We illustrate the practicality of our approach
Confluence properties of Weak and Strong Calculi of Explicit Substitutions
 JOURNAL OF THE ACM
, 1996
"... Categorical combinators [12, 21, 43] and more recently oecalculus [1, 23], have been introduced to provide an explicit treatment of substitutions in the calculus. We reintroduce here the ingredients of these calculi in a selfcontained and stepwise way, with a special emphasis on confluence prope ..."
Abstract

Cited by 129 (7 self)
 Add to MetaCart
properties. The main new results of the paper w.r.t. [12, 21, 1, 23] are the following: 1. We present a confluent weak calculus of substitutions, where no variable clashes can be feared. 2. We solve a conjecture raised in [1]: oecalculus is not confluent (it is confluent on ground terms only
Sharing in the weak lambdacalculus
 In Processes, Terms and Cycles: Steps on the Road
, 2005
"... Abstract. Despite decades of research in the λcalculus, the syntactic properties of the weak λcalculus did not receive great attention. However, this theory is more relevant for the implementation of programming languages than the usual theory of the strong λcalculus. In fact, the frameworks of w ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Abstract. Despite decades of research in the λcalculus, the syntactic properties of the weak λcalculus did not receive great attention. However, this theory is more relevant for the implementation of programming languages than the usual theory of the strong λcalculus. In fact, the frameworks
Weak Linearization of the LambdaCalculus
"... We identify a restricted class of terms of the lambda calculus, here called weak linear, that includes the linear lambdaterms keeping their good properties of strong normalization, nonduplicating reductions and typability in polynomial time. The advantage of this class over the linear lambdacalcu ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
We identify a restricted class of terms of the lambda calculus, here called weak linear, that includes the linear lambdaterms keeping their good properties of strong normalization, nonduplicating reductions and typability in polynomial time. The advantage of this class over the linear lambdacalculus
Querying the World Wide Web
, 1997
"... The World Wide Web is a large, heterogeneous, distributed collection of documents connected by hypertext links. The most common technology currently used for searching the Web depends on sending information retrieval requests to "index servers" that index as many documents as they can find ..."
Abstract

Cited by 257 (14 self)
 Add to MetaCart
find by navigating the network. One problem with this is that users must be aware of the various index servers (over a dozen of them are currently deployed on the Web), of their strengths and weaknesses, and of the peculiarities of their query interfaces. A more serious problem is that these queries
Duration Calculus of Weakly Monotonic Time
"... We extend Duration Calculus to a logic which allows description of Discrete Processes where several steps of computation can occur at the same time point. The resulting logic is called Duration Calculus of Weakly Monotonic Time (W DC). It allows effects such as true synchrony and digitisation to be ..."
Abstract

Cited by 23 (11 self)
 Add to MetaCart
We extend Duration Calculus to a logic which allows description of Discrete Processes where several steps of computation can occur at the same time point. The resulting logic is called Duration Calculus of Weakly Monotonic Time (W DC). It allows effects such as true synchrony and digitisation
The Weak Late picalculus Semantics as Observation Equivalence
 In Proc. CONCUR'95, Vol 962, Lecture
, 1995
"... . We show that the Weak Late calculus semantics can be characterized as ordinary Observation congruence over a specialized transition system where both the instantiation of input placeholders and the name substitutions, due e.g. to communication, are explicitly handled via suitable constructors. Th ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
. We show that the Weak Late calculus semantics can be characterized as ordinary Observation congruence over a specialized transition system where both the instantiation of input placeholders and the name substitutions, due e.g. to communication, are explicitly handled via suitable constructors
Power and weakness of the modal display calculus
 In Proof theory of modal logic
, 1996
"... The present paper explores applications of Display Logic as defined in [Belnap, 1982] to modal logic. Acquaintance with that paper is presupposed, although we will give all necessary definitions. Display Logic is a rather elegant prooftheoretic system that was developed to explore in depth the poss ..."
Abstract

Cited by 24 (0 self)
 Add to MetaCart
The present paper explores applications of Display Logic as defined in [Belnap, 1982] to modal logic. Acquaintance with that paper is presupposed, although we will give all necessary definitions. Display Logic is a rather elegant prooftheoretic system that was developed to explore in depth the possibility of total Gentzenization
Results 1  10
of
752