Publisher Summary Equations and formulas occur frequently in mathematics, logic, and
computer science. This chapter reviews the main results concerning equations and the …

This paper investigates some problems associated with an argument evaluation order that
we call “future” order, which is different from both call-by-name and call-by-value, In call-by …

Abstract Term Rewriting Systems play an important role in various areas, such as abstract
data type speci cations, implementations of functional programming languages and …

This article presents a syntactic calculus of partially-ordered data type structures and its
application to computation. A syntax of record-like terms and a type subsumption ordering …

One obtains in this paper a process algebra RCCS, in the style of CCS, where processes
can backtrack. Backtrack, just as plain forward computation, is seen as a synchronization …

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 …

Following Scott, the denotational semantics of programming languages are usually built
from the notion of continuous functions. The need for restricted models has been …

Nonambiguous lineai terni rewriting systems were introduced and studied in the first part of
this paper (chapter 11) In particular, it was shown that the space of derivations is a pushout …

Given the combinatorial nature of cellular signalling pathways, where biological agents can
bind and modify each other in a large number of ways, concurrent or agent-based …

All traditional implementation techniques for functional languages fail to avoid useless
repetition of work. They are not" optimal" in their implementation of sharing, often causing a …