Term graph rewriting is concerned with the representation of functional expressions as
graphs, and the evaluation of these expressions by rule-based graph transformation …

A program slice consists of the parts of a program that (potentially) affect the values
computed at some point of interest. Such a point of interest is referred to as a slicing …

Graph-based intermediate representations (IRs) are widely used for powerful compiler
optimizations, either interprocedurally in pure functional languages, or intraprocedurally in …

Term rewriting techniques are applicable to various fields of computer science, including
software engineering, programming languages, computer algebra, program verification …

The narrowing relation over terms constitutes the basis of the most important operational
semantics of languages that integrate functional and logic programming paradigms. It also …

The framework of graph transformation combines the potentials and advantages of both,
graphs and rules, to a single computational paradigm. In this paper we present some recent …

String diagrams are a powerful and intuitive graphical syntax, originating in theoretical
physics and later formalised in the context of symmetric monoidal categories. In recent …

Many compilers, synthesizers, and theorem provers rely on rewrite rules to simplify
expressions or prove equivalences. Developing rewrite rules can be difficult: rules may be …

We give an introduction to graph transformation, not only for researchers in software
engineering, but based on applications of graph transformation in this domain. In particular …

We propose an approach to declarative programming which integrates the functional and
relational paradigms by taking possibly non-deterministic lazy functions as the fundamental …