Rewriting logic is a simple computational logic that can naturally express both concurrent
computation and logical deduction with great generality. This paper provides a gentle …

We introduce a new framework of algebraic pure type systems in which we consider rewrite
rules as lambda terms with patterns and rewrite rule application as abstraction application …

This paper presents an overview on the use of the rewriting calculus to express rewrite
strategies. We motivate first the use of rewrite strategies by examples in the ELAN language …

The rewriting calculus, also called ρ-calculus, is a framework embedding λ-calculus and
rewriting capabilities, by allowing abstraction not only on variables but also on patterns. The …

Theoretical presentations of the ρ-calculus often treat the matching constraint computations
as an atomic operation although matching constraints are explicitly expressed. Actual …

The Rewriting Calculus (ρ-calculus, for short) was introduced at the end of the 1990s and
fully integrates term-rewriting and λ-calculus. The rewrite rules, acting as elaborated …

The objective of this thesis is to explore formal descriptions for the structure and functioning
of biological systems, as well as formal tools for reasoning about their behavior. This work …

Introduced at the end of the nineties, the Rewriting Calculus (ρ-calculus, for short) is a
simple calculus that fully integrates term-rewriting and λ-calculus. The rewrite rules, acting …

The last few years have seen the development of the rewriting calculus (also called rho-
calculus or ρ-calculus) that uniformly integrates first-order term rewriting and the λ-calculus …

We define a domain-specific language (DSL) to inductively assemble flow networks from
small networks or modules to produce arbitrarily large ones, with interchangeable …