Bibliography on Abstract Data Types

Kutzler, B.; Lichtenberger, F.

doi:10.1007/978-3-642-69032-7

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

1983

2022

Publication Types

Select...

Book5

Article1

Relationship

Self Cite0

Independent6

Authors

Journals

Cited by 12 publications

(1 citation statement)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Term-rewriting systems are an important tool to analyze the consistency of algebraic specifications, and are also becoming increasingly important for implementation. Some general references for algebraic specifications are [9,11,12,15,18]. Some general references for term-rewriting systems are [13,19,20,16].…”

Section: Introductionmentioning

confidence: 99%

Term-rewriting systems with rule priorities

Baeten

Bergstra

Klop

et al. 1989

Theoretical Computer Science

View full text Add to dashboard Cite

In this paper we discuss term-rewriting systems with rule priorities, which simply is a partial ordering on the rules. The procedural meaning of such an ordering then is, that the application of a rule of lower priority is allowed only if no rule of higher priority is applicable. The semantics of such a system is discussed. It turns out that the class of all bounded systems indeed has such a semantics. * Partial support received from the European Communities under ESPRIT Contract No. 432, Meteor (an integrated formal approach to industrial software development).

show abstract

Section: Introductionmentioning

confidence: 99%