Ueda, K., Resource-Passing Concurrent Programming. In Proc. TACS  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Automated Programming Framework Using - Constraint-Based Static Analysis (Correct)
....a mode graph computed by Kima is not always principal , but the strengthening of constraints reduces most non binary constraints to unary ones. Our observation is that virtually all nonlinear variables have been used for one way multicasting and the strengthening causes no problem in practice [33]. Rule (HV) comes from the semantics of Flat GHC that multiple occurrences of a variable in a clause head must receive completely identical terms. Rule (GV) means the occurrence of a variable in a clause head is regarded as an inlet if the variable is tested in the guard. Rule (BF) says that a ....
K. Ueda. Resource-Passing Concurrent Programming. In Proc. Fourth Int. Symp. on Theoretical Aspects of Computer Software, number 2215 in LNCS, pages 95--126. Springer, 2001.
Programming with Logical Links: Design of the LMNtal language.. - Ueda, Kato (2002) (Correct)
....describe the design background of LMNtal. The first author designed Guarded Horn Clauses (GHC) 12] in mid 1980 s, a concurrent language that made use of the power of logical variables to feature channel mobility. Various type systems such as mode and linearity systems were later designed for GHC [13]. A lot of implementation e#orts and techniques have been accumulated. Concurrent logic programming was generalized to concurrent constraint programming that allowed data domains other than finite trees, and a concurrent constraint language Janus [11] chose multisets (also called bags) as an ....
....neighboring processes and logical neighborhood relations between data cells. Two major mechanisms in concurrency formalisms are name based communication (as in the # calculus) and constraint based communication using logical, single assignment variables (as in concurrent constraint programming [13]) Of these, links of LMNtal are closer to communication using logical variables in that (i) a message sent through a link changes the identity of the link and (ii) links are always private (i.e. third processes cannot access them) The first point is the key di#erence from the # calculus. ....
[Article contains additional citation context not shown here]
Ueda, K., Resource-Passing Concurrent Programming. In Proc. TACS
LMNtal: a language model with links and membranes - Kazunori Ueda Norio Self-citation (Ueda) (Correct)
No context found.
Ueda, K., Resource-Passing Concurrent Programming. In Proc. TACS
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC