Habel, A. and D. Plump, Complete strategies for term graph narrowing, in: Recent Trends in Algebraic Development Techniques, Selected Papers, Lecture Notes in Computer Science 1589 (1999), pp. 152-167. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On Collapsing Narrowing - Echahed, Janodet (Correct)
....collapsed are the graphs, the shorter are the narrowing derivations. A rst step towards the investigation of graph narrowing has been done in [23, 17, 12] for acyclic graphs and in [8] for cyclic admissible graphs. Integration of graph collapsing and graph narrowing has been considered recently [17, 13] in the particular case of acyclic term graphs. As for graph narrowing strategies, only basic narrowing was considered in the literature [17, 13] However, basic narrowing was the rst term narrowing strategy to be studied [15, 18] It has not the optimality properties of modern narrowing ....
....[23, 17, 12] for acyclic graphs and in [8] for cyclic admissible graphs. Integration of graph collapsing and graph narrowing has been considered recently [17, 13] in the particular case of acyclic term graphs. As for graph narrowing strategies, only basic narrowing was considered in the literature [17, 13]. However, basic narrowing was the rst term narrowing strategy to be studied [15, 18] It has not the optimality properties of modern narrowing strategies such as needed narrowing [2] or parallel narrowing [4] In this paper, we take the full advantage of the graph structure and investigate the ....
[Article contains additional citation context not shown here]
A. Habel and D. Plump. Complete strategies for term graph narrowing. In Recent Trends in Algebraic Development Techniques. LNCS 1589, 1999.
Solving Equations by Graph Transformation - Habel, Plump (2001) Self-citation (Habel Plump) (Correct)
No context found.
Habel, A. and D. Plump, Complete strategies for term graph narrowing, in: Recent Trends in Algebraic Development Techniques, Selected Papers, Lecture Notes in Computer Science 1589 (1999), pp. 152-167.
Appligraph: Applications of Graph Transformation - Final Report - Kreowski, (eds.) (2002) Self-citation (Plump) (Correct)
No context found.
Annegret Habel and Detlef Plump. Complete strategies for term graph narrowing. In Recent Developments in Algebraic Development Techniques, Selected Papers, volume 1589 of Lecture Notes in Computer Science. Springer, 1999.
Appligraph: Applications of Graph Transformation - Second.. - Kreowski, (eds.) (1999) Self-citation (Plump) (Correct)
....Finally, in [BM99] an higher order extension of tile logic is discussed, which can provide a powerful type framework with applications to the area of reactive calculi with mobility and higher order features. 4.3. 4 Design and Implementation of Programming Languages The contents of the paper [HP99] have been described in the First Annual Progress Report. The group in Nijmegen has investigated the suitability of the functional language CONCURRENT CLEAN [KFS 98, PvE98] for the timely development and maintanance of quality software. The CLEAN system has the advantage that it runs on ....
Annegret Habel and Detlef Plump. Complete strategies for term graph narrowing. In Recent Developments in Algebraic Development Techniques, Selected Papers, volume 1589 of LNCS. Springer-Verlag, 1999.
Term Graph Rewriting - Plump (1998) (21 citations) Self-citation (Plump) (Correct)
....and confluent, for term graph narrowing one has to require that ) coll is normalizing and confluent. In Subsection 8.2 we discuss the completeness of two restricted forms of term graph narrowing, called minimally collapsing and maximally collapsing narrowing. Our presentation is based on [46, 45]. 8.1 Term graph narrowing We will need substitutions replacing variables in term graphs by term graphs. A pair x=G consisting of a variable x and a term graph G is a substitution pair. It is applied to an x labelled edge e in a term graph H by removing e, adding (disjointly) G, and identifying ....
....Maximally collapsing narrowing is complete whenever ) coll is convergent. Note that as a corollary of this result, maximally collapsing narrowing is complete for all convergent term rewriting systems. 8. 3 Bibliographic notes The present definition of term graph narrowing was introduced in [46]. It extends the definition in [45] in that the latter corresponds to the special case where all nodes in the set U represent the same term. The paper [46] also studies basic term graph narrowing, an analogue to basic term based narrowing [55] Roughly speaking, this strategy forbids narrowing ....
[Article contains additional citation context not shown here]
Annegret Habel and Detlef Plump. Complete strategies for term graph narrowing. Submitted for publication, 1998.
Appligraph: Applications of Graph Transformation - Third.. - Kreowski, (eds.) (2000) Self-citation (Plump) (Correct)
....on the availability of supporting libraries. In this report year we have released a number of libraries to make Clean useful not only inside the academic environment: ArgEnv, CLAS, Directory, htoclean, MersenneTwister, Object I O, 2D Platform Games, TCP, WrapDebug. 29 The contents of the paper [HP99] has been described in the First Annual Progress Report. 4.3.5 Speci cation of Software Engineering Models The modeling of behavior in object oriented systems usually relies on control ow diagrams and (extended) state automatas. These basic techniques do not well support the design in a ....
Annegret Habel and Detlef Plump. Complete strategies for term graph narrowing. In Recent Developments in Algebraic Development Techniques, Selected Papers, volume 1589 of Lecture Notes in Computer Science. Springer-Verlag, 1999.
Term Graph Rewriting - Plump (1998) (21 citations) Self-citation (Plump) (Correct)
....and confluent, for term graph narrowing one has to require that ) coll is normalizing and confluent. In Subsection 1.8.2 we discuss the completeness of two restricted forms of term graph narrowing, called minimally collapsing and maximally collapsing narrowing. Our presentation is based on [44,46]. 1.8.1 Term Graph Narrowing We will need substitutions replacing variables in term graphs by term graphs. A pair x=G consisting of a variable x and a term graph G is a substitution pair. It is applied to an x labelled edge e in a term graph H by removing e, adding (disjointly) G, and ....
....Maximally collapsing narrowing is complete whenever ) coll is convergent. ut Note that as a corollary of this result, maximally collapsing narrowing is complete for all convergent term rewriting systems. 1.8. 3 Bibliographic Notes The present definition of term graph narrowing was introduced in [44]. It extends the definition in [46] in that the latter corresponds to the special case where all nodes in the set U represent the same term. The paper [44] also 1.9. FURTHER TOPICS 53 studies basic term graph narrowing, an analogue to basic term based narrowing [55] Roughly speaking, this ....
[Article contains additional citation context not shown here]
Annegret Habel and Detlef Plump. Complete strategies for term graph narrowing. In Recent Developments in Algebraic Development Techniques, Selected Papers, Lecture Notes in Computer Science. SpringerVerlag. To appear.
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