Glauert J.R.W., Hammond K., Kennaway J.R., Papdopoulos G.A., Sleep M.R., DACTL: Some Introductory Papers. School of Information Systems, University of East Anglia, Norwich, U.K, (1988).  Home/Search   Document Not in Database   Summary   Related Articles   Check

....Watson (1987) Watson et ah (1987) Watson et ah (1989) Since the machine needed a runtime system, whose implementation centred round MONSTR, the 339 connection with operating systems emerges. In fact MONSTR evolved as a restriction of a more general term graph rewriting language DACTL, see Glauert et al. 1988a) Glauert et al. 1988b) the restrictions being forced by implementation issues. MONSTR therefore rejoices in the virtue of having been implemented in anger for a real machine. In particular, the directed arcs of a MONSTR graph are intended to be directly modeled by pointers in a ....

....et ah (1987) Watson et ah (1989) Since the machine needed a runtime system, whose implementation centred round MONSTR, the 339 connection with operating systems emerges. In fact MONSTR evolved as a restriction of a more general term graph rewriting language DACTL, see Glauert et al. 1988a) Glauert et al. 1988b)] the restrictions being forced by implementation issues. MONSTR therefore rejoices in the virtue of having been implemented in anger for a real machine. In particular, the directed arcs of a MONSTR graph are intended to be directly modeled by pointers in a conventional store in the ....

Glauert J.R.W., Hammond K., Kennaway J.R., Papdopoulos G.A., Sleep M.R., DACTL: Some Introductory Papers. School of Information Systems, University of East Anglia, Norwich, U.K, (1988).

....parallel machines. A successful model should be abstract enough to avoid the implementation details of particular machines, and yet concrete enough to serve as an intermediate target language for compilers. Graph rewriting provides one promising area within which to search for such models [43, 32, 15, 41], and colimits seem to be quite useful here [10, 58, 44] Graph rewriting is also important for the unification grammars that are now popular in linguistics [60, 22] There seem to be many opportunities for further research in these areas. 6.3 Initiality. The simplest possible diagram is the empty ....

J.R.W. Glauert, K. Hammond, J.R. Kennaway, G.A. Papadopoulos, and M.R. Sleep. DACTL: Some introductory papers. Technical Report SYS-C88-08, School of Information Systems, University of East Anglia, 1988.

....rewrites as certain kinds of pushout. See [Ken87, HP88, HKP88, Ken91] Nevertheless, none of these constructions successfully describe the whole of the operational models of [BvEG 87] where term graph rewriting was introduced, or of its generalization in the language DACTL itself [GKSS88, GHK 88, GKS91, Ken90]. The main stumbling blocks for all of these attempts have been examples such as the I combinator root:I[a] a when applied to a circular instance of itself x:I[x] None of the hitherto proposed categorical formulations of TGR adequately capture the DACTL version of the rewrite (which is, ....

J.R.W. Glauert, K. Hammond, J.R. Kennaway, G.A. Papdopoulos, M.R. Sleep. DACTL: Some Introductory Papers. School of Information Systems, University of East Anglia, Norwich, UK.

.... and Plump (1988) and Kennaway (1991) Nevertheless none of these constructions successfully describe the whole of the operational models of Barendregt et al. 1987) where term graph rewriting was introduced, or of its generalisation in the general term graph rewriting language DACTL itself (Glauert et al. 1988a, b, 1990) Kennaway (1990)) The main stumbling blocks for all of these attempts have been examples such as the I combinator I[ x ] x when applied to a circular instance of itself a : I[ a ] None of the hitherto proposed categorical formulations of TGR adequately capture the DACTL version of the rewrite (which is, ....

Glauert J.R.W., Hammond K., Kennaway J.R., Papadopoulos G.A., Sleep M.R. (1988b), DACTL: Some Introductory Papers. Report SYS-C88-08, School of Information Systems, University of East Anglia, Norwich, U.K.

....the Journal of Universal Computer Science, vol. 1, no. 6 (1995) 335 395 submitted: 20 10 94, accepted: 26 6 95, appeared: 28 6 95 Springer Pub. Co. connection with operating systems emerges. In fact MONSTR evolved as a restriction of a more general term graph rewriting language DACTL, see Glauert et al. 1988a) Glauert et al. 1988b) the restrictions being forced by implementation issues. MONSTR therefore rejoices in the virtue of having been implemented in anger for a real machine. In particular, the directed arcs of a MONSTR graph are intended to be directly modeled by pointers in a conventional ....

....Computer Science, vol. 1, no. 6 (1995) 335 395 submitted: 20 10 94, accepted: 26 6 95, appeared: 28 6 95 Springer Pub. Co. connection with operating systems emerges. In fact MONSTR evolved as a restriction of a more general term graph rewriting language DACTL, see Glauert et al. 1988a) Glauert et al. 1988b)] the restrictions being forced by implementation issues. MONSTR therefore rejoices in the virtue of having been implemented in anger for a real machine. In particular, the directed arcs of a MONSTR graph are intended to be directly modeled by pointers in a conventional store in the overwhelming ....

Glauert J.R.W., Hammond K., Kennaway J.R., Papdopoulos G.A., Sleep M.R., DACTL: Some Introductory Papers. School of Information Systems, University of East Anglia, Norwich, U.K, (1988).

....Graph Rewriting, MONSTR, Semantic Models. Category: C.1.3, D.1.3, D.3.1, F.3.2, F.4. 2 1 INTRODUCTION This is the first of a series of papers about MONSTR, in which we will study the problem of implementing an extended term graph rewriting model of computation described by the language DACTL [Glauert et al. 1988a) Glauert et al. 1988b) Glauert et al. 1990) on a distributed store architecture, from a fairly theoretical vantage point. The issue arose in the late 80 s when the Flagship Project intended to use DACTL as a general purpose intermediate language for a distributed store multiprocessor, ....

....Semantic Models. Category: C.1.3, D.1.3, D.3.1, F.3.2, F.4. 2 1 INTRODUCTION This is the first of a series of papers about MONSTR, in which we will study the problem of implementing an extended term graph rewriting model of computation described by the language DACTL [Glauert et al. 1988a) [Glauert et al. 1988b) Glauert et al. 1990) on a distributed store architecture, from a fairly theoretical vantage point. The issue arose in the late 80 s when the Flagship Project intended to use DACTL as a general purpose intermediate language for a distributed store multiprocessor, the Flagship Machine, ....

Glauert J.R.W., Hammond K., Kennaway J.R., Papdopoulos G.A., Sleep M.R., DACTL: Some Introductory Papers. School of Information Systems, University of East Anglia, Norwich, U.K, (1988).

....of single rewrites can take G to H. Thus adding parallel composition to a rewrite system can change its reduction relation. Whether the results of parallel composition of rewrites are useful is a subject for further study. Dactl is a graph rewrite language intended for parallel implementation (see [GHKPS88, GKS89], and in this volume [GKS90] Its definition currently stipulates that the result of a computation must be identical to the result of some series of rewrites. This serialisability requirement was imposed to facilitate reasoning about Dactl programs. However, if the semantics of parallel rewrites ....

J.R.W. Glauert, K. Hammond, J.R. Kennaway, G.A. Papadopoulos, and M.R. Sleep "Dactl: some introductory papers", Report SYS-C88-08, University of East Anglia, Norwich, U.K., 1988

No context found.

J.R.W. Glauert, K. Hammond, J.R. Kennaway, G.A. Papdopoulos, M.R. Sleep. DACTL: Some Introductory Papers. School of Information Systems, University of East Anglia, Norwich, UK, 1988.

No context found.

Glauert J.R.W., Hammond K., Kennaway J.R., Papdopoulos G.A., Sleep M.R. (1988b), DACTL: Some Introductory Papers, School of Information Systems, University of East Anglia, Norwich, U.K.

No context found.

Glauert J.R.W., Hammond K., Kennaway J.R., Papdopoulos G.A., Sleep M.R. (1988b), DACTL: Some Introductory Papers, School of Information Systems, University of East Anglia, Norwich, U.K.

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