scientific article; zbMATH DE number 234035

From MaRDI portal

zbMath0818.68099MaRDI QIDQ5287535

No author found.

Publication date: 9 July 1993


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

Sharing in the Graph Rewriting Calculus, Lazy rewriting and eager machinery, Semantics and strong sequentially of priority term rewriting systems, Lambda calculus with explicit recursion, Relating graph and term rewriting via Böhm models, Labelled graph strategic rewriting for social networks, Highlights in infinitary rewriting and lambda calculus, Critical pairs in term graph rewriting, Initial Conflicts for Transformation Rules with Nested Application Conditions, Towards ``mouldable code via nested code graph transformation, Rewriting logic as a semantic framework for concurrency: a progress report, On termination of graph rewriting, Concurrent graph and term graph rewriting, Unnamed Item, Unnamed Item, Unnamed Item, Embedding and Confluence of Graph Transformations with Negative Application Conditions, Unfolding-Based Diagnosis of Systems with an Evolving Topology, Locating the contractum in the double pushout approach, The contractum in algebraic graph rewriting, Synchronized composition of graph grammar productions, Term graph rewriting, A complete proof system for Nested Term Graphs, Graph-based communication in Eden, Categorical rewriting of term-like structures, Solving Equations by Graph Transformation, Decidable call-by-need computations in term rewriting, Programming with narrowing: a tutorial, Lawvere Categories as Composed PROPs, Compiling Collapsing Rules in Certain Constructor Systems, Rewriting on cyclic structures: Equivalence between the operational and the categorical description, Transformation rules with nested application conditions: critical pairs, initial conflicts \& minimality, A Heterogeneous Pushout Approach to Term-Graph Transformation, Semantics and strong sequentiality of priority term rewriting systems, GS·Λ Theories, Context-sensitive fusion grammars and fusion grammars with forbidden context are universal, A comparison of tree transductions defined by monadic second order logic and by attribute grammars, Descendants and origins in term rewriting., On Term-Graph Rewrite Strategies, Towards a Sharing Strategy for the Graph Rewriting Calculus, Relating conflict-free stable transition and event models via redex families, Comparing logics for rewriting: Rewriting logic, action calculi and tile logic, Interaction nets and term rewriting systems (extended abstract), Relative normalization in Deterministic Residual Structures