Kazunori Ueda, Designing a Concurrent Programming Language. In Proc. an International Conference organized by the IPSJ to Commemorate the 30th Anniversary (InfoJapan'90), Information Processing Society of Japan, October 1990, pages 87-94.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....we can only make sequential access to an in nite list, and computation stalls whenever a bottom is encounted. Contrary to this, if we use a logic programming language with guarded clauses and committed choice such as Concurrent Prolog [7] PARLOG[2] and (Flat) GHC (Guarded Horn Clauses)[12,13], we can directly express the behavior of an IM2 machine as a program, and execute it on an ordinary computer. The ability of an IM2 machine to wait for the next character from multiple heads corresponds to parallel execution of guards, and the indeterminism of an IM2 machine corresponds to ....

....committed choice. In this language, the system does not search solutions by backtracking. Therefore, the value of a variable once computed is never revoked. In the following sections, we will study implementations of IM2 machines in the language KL1[11] which is based on the concept of Flat GHC [12,13]. Since Flat GHC is a sublanguage of GHC, we will simply call the language GHC. A GHC program is a set of guarded clauses of the following form: H : G 1 ; G n B 1 ; Bm 12 main : pinf(Y) sum(X,Y) naturals(0,X) naturals(N, X) X = N XX] N1 : N 1, naturals(N1, XX) ....

Kazunori Ueda, Designing a Concurrent Programming Language. In Proc. an International Conference organized by the IPSJ to Commemorate the 30th Anniversary (InfoJapan'90), Information Processing Society of Japan, October 1990, pages 87-94.

....of programming processes as future work. 8 CHAPTER 1. Moded Flat GHC and Strong Moding and Typing This chapter outlines the mode and type system of Moded Flat GHC. We refer to the analysis cost and polymorphism after the definition of the mode and type system. The readers are referred to [29, 30, 36, 31] for details. 2.1 Moded Flat GHC Moded Flat GHC is a concurrent logic language where a mode system has been introduced into Flat GHC, a subset of Guarded Horn Clauses (GHC) GHC has a lot of similarities to Prolog, a logic language, but they are essentially di#erent languages. GHC is a ....

K. Ueda. Designing a Concurrent Programming Language. In Proc. Int. Conf. organized by the IPSJ to Commemorate the 30th Anniversary (InfoJapan'90), pages 87--94. Information Processing Society of Japan, 1990.

....we are confine ourselves to termination properties. 2.1. 1 Flat GHC Flat GHC, a subset of the GHC language has been found to be adequate for most of the applications, and can be easily implemented as compared to the full GHC language [29]. Definition 3 A predicate p is called a test predicate if all the clauses defining p are unit clauses. Since unit clauses do not contain any unification subgoals, calls to test predicates do not instantiate any variables. Definition 4 A GHC clause is flat if its guard atoms are restricted to ....

K. Ueda (1990), Designing a concurrent programming language, Proc. of InfoJapaan'90 (organized by the Information Processing Society of Japan), pp. 87-94.

....constraint framework, Honda et al. 1] compared GHC features with those of the Actor model and describes the implementation of GHC in actors, and Nystrom [6] presented the execution model of FGHC described in the SCL language. So far there have been many studies on the semantics of GHC [8][5] but to examine the program s behavior and properties more precisely it would be convenient for the semantics to be constructed on an already well studied domain or model. In this regard, we thought that calculus is noteworthy. During the computation (reduction) of calculus, agents ....

....The active unification in the first clause Y i = Z o is translated to fw[z; y] and the c var Z s in the second clause is translated to var[z s ; v 18 ] 4 Calculus Semantics 4. 1 Ueda s Operational Semantics of GHC Ueda s operational semantics of GHC is based on a transition system [8]. The configuration represents the computation states of an entire system and is defined as hB; Ci : V. B is a multiset of all goals, such as p(X) Y = w(Z) C is the constraints on the variables generated by active unification. V is var(B [ C) P is a program which is a set of clauses. Using the ....

K. Ueda. Designing A Concurrent Programming Language. In Proc. of InfoJapan'90, Information Processing Society of Japan, pp.87--94 (1990).

.... 1 proposed technique will expand the application areas of concurrent logic languages. Keywords: Concurrent logic programming, Moded Flat GHC, Static mode system, Constraint based program analysis, Message oriented implementation. 1. Introduction Guarded Horn Clauses (GHC) 16] 17][19] is a simple concurrent logic language born from the research on parallelism in logic programming. Its subset, Flat GHC [19] 21] can be viewed naturally as a process description language in which the static property of a process (implemented by a multiset of body goals) namely the relationship ....

....logic programming, Moded Flat GHC, Static mode system, Constraint based program analysis, Message oriented implementation. 1. Introduction Guarded Horn Clauses (GHC) 16] 17] 19] is a simple concurrent logic language born from the research on parallelism in logic programming. Its subset, Flat GHC [19] [21] can be viewed naturally as a process description language in which the static property of a process (implemented by a multiset of body goals) namely the relationship between input and output information, is expressed in terms of its logical reading and in which the dynamic property, namely ....

[Article contains additional citation context not shown here]

Ueda, K., Designing A Concurrent Programming Language. In Proc. InfoJapan'90, Information Processing Society of Japan, 1990, pp. 87--94.

No context found.

K. Ueda (1990), Designing a concurrent programming language, Proc. of InfoJapan'90 (organized by the Information Processing Society of Japan), pp. 87-94.

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