We propose Conditional Set Rewriting as a general mechanism for describing the syntax of multidimensional languages. We compare the approach with other existing methods, and give a number of examples that illustrate its strengths. 1 Introduction This paper introduces the notion of a Conditional Set Rewrite System (CSRS). Conditional Set Rewrite Systems are a generalization of Conditional Term Rewrite Systems [10]. Conditional Term Rewrite Systems deal with rewriting a single term, whereas Conditional Set Rewrite systems deal with rewriting a set of terms. Each conditional set rewrite rule specifies how to replace a subset of the set of terms by another set. We suggest two uses for CSRS: they can be used to describe the set of all legal ph...
This thesis work presents a methodology for modeling and implementing visual languages. The approach...
The semantic formalism reference attribute grammars (RAGs) allows graphs to be superimposed on abstr...
AbstractFor reasons of efficiency, term rewriting is usually implemented by graph rewriting. Barendr...
We propose a new paradigm for the specification of the syntax and semantics of visual languages, whe...
Computers are increasingly being seen not only as computing tools but more so as communication tools...
textabstractIn this paper a translation from a subclass of logic programs consisting of the simply m...
AbstractSystem S is a calculus providing the basic abstractions of term rewriting: matching and buil...
In a rule-based approach the computation steps of a system are specified by rules that completely de...
We present an algorithmic method to obtain pure rewriting systems from logical descriptions of langu...
We present an algorithmic method to obtain pure rewriting systems from logical descriptions of langu...
Abstract. An automated technique to translate conditional rewrite rules into unconditional ones is p...
. We transpose a conservative extension theorem from structural operational semantics to conditional...
textabstractMany systems are at least partly or implicitly based on term rewriting. Examples are fun...
AbstractAlgebraic specifications of abstract data types can often be viewed as systems of rewrite ru...
Conditional rewrite rules are notorious for being difficult to implement in rewrite engines. This is...
This thesis work presents a methodology for modeling and implementing visual languages. The approach...
The semantic formalism reference attribute grammars (RAGs) allows graphs to be superimposed on abstr...
AbstractFor reasons of efficiency, term rewriting is usually implemented by graph rewriting. Barendr...
We propose a new paradigm for the specification of the syntax and semantics of visual languages, whe...
Computers are increasingly being seen not only as computing tools but more so as communication tools...
textabstractIn this paper a translation from a subclass of logic programs consisting of the simply m...
AbstractSystem S is a calculus providing the basic abstractions of term rewriting: matching and buil...
In a rule-based approach the computation steps of a system are specified by rules that completely de...
We present an algorithmic method to obtain pure rewriting systems from logical descriptions of langu...
We present an algorithmic method to obtain pure rewriting systems from logical descriptions of langu...
Abstract. An automated technique to translate conditional rewrite rules into unconditional ones is p...
. We transpose a conservative extension theorem from structural operational semantics to conditional...
textabstractMany systems are at least partly or implicitly based on term rewriting. Examples are fun...
AbstractAlgebraic specifications of abstract data types can often be viewed as systems of rewrite ru...
Conditional rewrite rules are notorious for being difficult to implement in rewrite engines. This is...
This thesis work presents a methodology for modeling and implementing visual languages. The approach...
The semantic formalism reference attribute grammars (RAGs) allows graphs to be superimposed on abstr...
AbstractFor reasons of efficiency, term rewriting is usually implemented by graph rewriting. Barendr...