-Rewriting systems are popular in end-user prcgramming because complex behavior can be described with few or no abstractions or variables. However, rewriting systems have been limited t o manipulating non-rotatable objects on a grid, such as in Agentsheets or Stageeast Creator. Systems that allow free-form movement of objects must use other techniques, such as the sequential programming by demo...

We define a graph rewriting system that is easily understandable by humans, but rich enough to allow very general queries to molecule databases. It is based on the substitution of a single node in a nodeand edge-labeled graph by an arbitrary graph, explicitly assigning new endpoints to the edges incident to the replaced node. For these graph rewriting systems, we are interested in the subgraph-...

Autostackability for finitely generated groups is defined via a topological property of the associated Cayley graph which can be encoded in a finite state automaton. Autostackable groups have solvable word problem and an effective inductive procedure for constructing van Kampen diagrams with respect to a canonical finite presentation. A comparison with automatic groups is given. Another charact...

Digitalization is rewriting the track of economic development and becoming a new driving force for growth. It great significance enterprises to better complete digital transformation scientifically rationally understand key indicators their interrelationships in financial management risks. This paper constructs index system enterprise risk under background transformation, uses interpretative st...

Jungle evaluation is an approach to deene term rewriting with sharing based on graph grammars. This approach preserves important properties of term rewriting like termination, and connuence for terminating systems (under mild restrictions). In this paper, term rewriting with sharing is further accelerated, by memo zation known from functional programming languages: The result of evaluating a fu...

When late-binding of advice is used for incremental development or configuration, implementing advice weaving using code rewriting external to the VM can cause performance problems during application startup. We present an interpreter-based (non-rewriting) weaver that uses a simple table and cache structure for matching pointcuts against dynamic join points together with a simple mechanism for ...

Effective theorem provers are essential for automatic verification and generation of programs. The conventional resolution strategies, albeit complete, are inefficient. On the other hand, special purpose methods, such as term rewriting systems for solving word problems, are relatively efficient but applicable to only limited classes of problems. In this paper, a simple canonical set of rewrite ...

In these lectures we will introduce an interactive system that supports writing simple functional programs. Using this system, students learning functional programming: – develop their programs incrementally, – receive feedback about whether or not they are on the right track, – can ask for a hint when they are stuck, – see how a complete program is stepwise constructed, – get suggestions about...

A nite string-rewriting system R preserves regularity if and only if it preserves-regularity, where is the alphabet containing exactly those letters that have occurrences in the rules of R. This proves a conjecture of Gyenizse and VV agvv olgyi (1995). In addition, some undecidability results are presented that generalize some results of Gilleron and Ti-son (1995) from term-rewriting systems to...

Adding rewriting to a proof assistant based on the Curry-Howard isomorphism, such as Coq, may greatly improve usability of the tool. Unfortunately adding an arbitrary set of rewrite rules may render the underlying formal system undecidable and inconsistent. While ways to ensure termination and confluence, and hence decidability of type-checking, have already been studied to some extent, logical...