Papadopoulos,G.A. (1989a) Parallel implementation of concurrent logic languages using graph rewriting techniques. Ph.D. Thesis, University of East Anglia, UK. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Implementing Concurrent Logic and Functional Languages in Dactl - Papadopoulos (1997) Self-citation (Papadopoulos) (Correct)
No context found.
Papadopoulos,G.A. (1989a) Parallel implementation of concurrent logic languages using graph rewriting techniques. Ph.D. Thesis, University of East Anglia, UK.
Parallel Term Graph Rewriting and Concurrent Logic Programs - Banach, Papadopoulos (2 citations) Self-citation (Papadopoulos) (Correct)
....development of the underlying machine; indeed, such an implementation would not be restricted to a single machine since DACTL itself is designed to be portable to a number of machines. Possible implementations of functional and concurrent logic languages through the DACTL route are discussed in [6,7,9,10,11]. However, these papers address only the top part of the implementation i.e. the mapping of systems of equations or clauses to equivalent systems of DACTL rewrite rules. 1. Email: banach cs.man.ac.uk 2. Permanent address: Dept. of Computer Science, University of Cyprus, Nicosia, P.O.B. 537, ....
....we will be concerned with here. Because of space considerations, we will illustrate the main points involved by discussing the behaviour of a series of examples. A more formal translation scheme is implicit in the implementation built by the second author and is described in his doctoral thesis ([11]) In the sequel we use a Kernel Parlog or GHC like syntax. The techniques apply to unsafe GHC programs as well; see, however, the discussion at the end of this section on the implementation of the pointer equality primitive necessary for this. The following non deterministic merge program ....
Papadopoulos G. A., Parallel Implementation of Concurrent Logic Languages Using Graph Rewriting Techniques, Ph.D. Thesis, University of East Anglia, Norwich, UK, 1989.
Linear Behaviour Of Term Graph Rewriting Programs - Banach, Papadopoulos (2 citations) Self-citation (Papadopoulos) (Correct)
....be reasoned about mathematically. A number of groups, in particular in Nijmegen, East Anglia and London, have taken up TGRSs as a useful vehicle at the implementation level. The ability of TGRS to accommodate the, often divergent, needs of a number of language families such as concurrent logic ([13]) and functional ( 10] justifies its nature as a general purpose computational model, and languages based on TGRSs are suitable as compiler target (intermediate) languages. In particular, a number of specific TGR languages have been developed, all closely related, among which we may mention Clean ....
....program written in a non linear concurrent language. In particular, we compare the linear version of Append presented in the previous section with the equivalent version written in a state of the art concurrent logic language ( 17] which was translated to MONSTR using the techniques described in [3,13]. The programs were run using the Dactl interpreter ( 9] and exploiting the statistics facilities offered by that implementation. Note that what we compare here are the relative differences in the statistics of the two programs rather than the absolute performance figures. Perf Params: R PC AvP ....
[Article contains additional citation context not shown here]
G. A. Papadopoulos, Parallel Implementation of Concurrent Logic Languages Using Graph Rewriting Techniques, Ph.D. Thesis, School of Information Systems, University of East Anglia, Norwich, UK, 1989.
Implementing Concurrent Logic and Functional Languages in Dactl - Papadopoulos (1997) Self-citation (Papadopoulos) (Correct)
....translation of procedures belonging to the third category is not a trivial issue since all candidate clauses must be evaluated in parallel. The techniques reported in the literature generally involve a lot of George A. Papadopoulos 10 copying ( 21,26] Our technique described fully in [27,28] involves the use of an overwritable node to be instantiated to the body of the committed clause. In particular, assuming a procedure of the form p( g1( b1( p( g2( b2( where p s input patterns are overlapping and g1,g2 are non flat guards, the translation to ....
....and preserving order independence semantics. Most implementations of concurrent logic languages prefer to perform deep pattern matching sequentially, thus improving the performance of these operations at the expense of compromising the order independence nature of proper unification. In [27] we describe an algorithm for an order independent compilation of deep patterns and its implementation in Dactl. There, we also discuss the implementation of other features of CLLs such as metacalls. The techniques discussed so far can be used to implement in Dactl all CLLs having non atomic ....
[Article contains additional citation context not shown here]
G. A. Papadopoulos, Parallel Implementation of Concurrent Logic Languages Using Graph Rewriting Techniques, Ph.D. Thesis, Univ. of East Anglia, UK, 1989.
Dactl: An Experimental Graph Rewriting Language - Glauert, Kennaway.. (1991) (23 citations) Self-citation (Papadopoulos) (Correct)
....goal. The list of goals itself is naturally represented as a graph and the process of resolution becomes a process of transforming the goal graph in search of a solution. The effectiveness of using graph rewriting in the implementation of concurrent logic languages in particular is demonstrated in [Pap89]. Dactl is a very general model of computation based on graph rewriting. Using an interpreter for the notation, it has been possible to demonstrate working compilers for a surprisingly wide range of languages including Hope, LISP, Parlog, GHC, ML and Clean [Ham88, Ham90, Gla88a, Gla88b, Ken90a] ....
....which is reminiscent more of functional languages rather than (concurrent) logic ones, allows more efficient implementations at the expense of somewhat compromising the languages semantics. More information on how languages like Strand and Janus would be mapped on a CTL like Dactl can be found in [Pap89, Pap97]. Dactl: An Experimental Graph Rewriting Language 9 Append Ans Var Cons Cons 1 Nil 2 Nil Append Ans Nil Cons 2 Nil Cons 1 Var Ans Cons 1 Cons 2 Nil 2.5 Concurrent Programming In the last example, logic variables could be used for communication. Graph rewriting may be used to model ....
[Article contains additional citation context not shown here]
Papadopoulos, G.A., 1989, Parallel Implementation of Concurrent Logic Languages Using Graph Rewriting Techniques, Ph.D. Thesis, University of East Anglia, UK.
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