Addressed Term Rewriting Systems: Syntax, Semantics, and Pragmatics

Dougherty, Dan; Lescanne, Pierre; Liquori, Luigi; Lang, Frédéric

doi:10.1016/j.entcs.2004.12.042

Cited by 8 publications

(5 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The idea is also explored in [DLLL05]. In this setting the equality of labels corresponds to the physical equality of two terms, which should in turn imply their syntactic equality: two terms stored/drawn at the same place ought to be equal.…”

Section: Many Tools For Sharingmentioning

confidence: 99%

A unified approach to fully lazy sharing

Balabonski

2012

SIGPLAN Not.

View full text Add to dashboard Cite

We give an axiomatic presentation of sharing-via-labelling for weak λ-calculi, that makes it possible to formally compare many different approaches to fully lazy sharing, and obtain two important results. We prove that the known implementations of full laziness are all equivalent in terms of the number of β-reductions performed, although they behave differently regarding the duplication of terms. We establish a link between the optimality theories of weak λ-calculi and first-order rewriting systems by expressing fully lazy λ-lifting in our framework, thus emphasizing the firstorder essence of weak reduction.

show abstract

Section: Many Tools For Sharingmentioning

confidence: 99%

A unified approach to fully lazy sharing

Balabonski

2012

SIGPLAN Not.

View full text Add to dashboard Cite

show abstract

“…Indeed, existing confluence results such as [5,15,18,21,22,3,4,8] discard "side-effect" functions and do not consider term-graphs with priority either. On the other hand, none of the existing rewriting frameworks dealing with cyclic term-graphs such as [7,18,15,6,12,9,14] do integrate node constraints with local and global edge (pointer) redirections.…”

Section: Resultsmentioning

confidence: 98%

Rewriting term-graphs with priority

Caferra¹,

Echahed²,

Peltier³

2006

Proceedings of the 8th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming

View full text Add to dashboard Cite

We define a new class of rewrite systems operating over termgraphs. Our aim is twofold. First we propose to extend classical first-order rewrite rules in order to process easily data-structures with pointers (e.g., circular lists, doubly linked lists etc). For that, our rules provide specific features such as pointer (edges) redirections, relabeling of existing nodes etc. Unfortunately, such features are very often source of non confluence. Our second aim is then to ensure confluence of the considered rewrite systems in the new class. We introduce the notion of term-graphs with priority and show that orthogonal rewrite systems are confluent in our setting.

show abstract

“…But it is limited to the root and cannot be handled by the programmer. In [15] cyclic graphs are also studied using addressed term rewriting systems. In this case too the direct manipulation of pointers is not addressed.…”

Section: Related Workmentioning

confidence: 99%

Modeling Pointer Redirection as Cyclic Term-graph Rewriting

Duval¹,

Echahed

Prost

2007

Electronic Notes in Theoretical Computer Science

View full text Add to dashboard Cite

We tackle the problem of data-structure rewriting including global and local pointer redirections. Each basic rewrite step may perform three kinds of actions: (i) Local redirection, the aim of which is to redirect specific pointers determined by means of a pattern ; (ii) Replacement, that may add new information to data-structures ; (iii) Global redirection, which is aimed at redirecting all pointers targeting a node towards another one. We define a new framework, following the double-pushout approach, where graph rewrite rules may mix these three kinds of actions in a row. We define first the category of graphs we consider and then we define rewrite rules as pairs of graph homomorphisms of the form L ← K → R. In our setting, graph K is not arbitrary, it is used to encode pointer redirection. Furthermore, pushouts do not always exist and complement pushouts, when they exist, are not unique. Despite these concerns, our definition of rewriting steps is such that a rewrite rule can always be fired, once a matching is found.

show abstract

Addressed Term Rewriting Systems: Syntax, Semantics, and Pragmatics

Cited by 8 publications

References 6 publications

A unified approach to fully lazy sharing

A unified approach to fully lazy sharing

Rewriting term-graphs with priority

Modeling Pointer Redirection as Cyclic Term-graph Rewriting

Contact Info

Product

Resources

About