The ρ-calculus integrates in a uniform and simple setting first-order rewriting, λ-calculus and nondeterministic computations. Its abstraction mechanism is based on the rewrite rule formation and its… (More)

The ρ-calculus permits to express in a uniform and simple way firstorder rewriting, λ-calculus and non-deterministic computations as well as their combination. In this paper, we present the main… (More)

The ρ-calculus integrates in a uniform and simple setting first-order rewriting, λ-calculus and nondeterministic computations. Its abstraction mechanism is based on the rewrite rule formation and its… (More)

We survey and analyse the relevant existing work on typing of rules, in particular on typing of constraint logic programs and discuss applicability of these approaches to the REWERSE reasoning and… (More)

The rewriting calculus, or Rho Calculus (ρCal), is a simple calculus that uniformly integrates abstraction on patterns and nondeterminism. Therefore, it fully integrates rewriting and λ-calculus. The… (More)

The last few years have seen the development of a new calculus which can be considered as an outcome of the last decade of various researches on (higher order) term rewriting systems, and lambda… (More)

Programming with rewrite rules and strategies has been already used for describing several computational logics. This paper describes the way the Needham-Schroeder Public-Key protocol is specified in… (More)

Rewriting techniques are now recognized as a fundamental concept in many areas of computer science including mechanized theorem proving and operational semantics of programming languages. From a… (More)