We present a useful web interface for tools that participate in the annual confluence competition.

We assume that the Stefan problem with undercooling has a classical solution until the moment of contact of free boundaries and the free boundaries have continuous velocities until the moment of contact. Under these assumptions , we construct a smooth approximation of the global solution of the Stefan problem with undercooling, which, until the contact, gives the classical solution mentioned ab...

BACKGROUND After establishment of a cell culture, inhomogenous growth and cell selection takes place at early passages. Reproducing the same confluence state among experiments might be difficult. MATERIALS AND METHODS Here we used cDNA arrays to compare the global gene expression pattern of two oral cancer cell lines at 80%, 100% and super-confluence stages. Also, the stability of the global ...

Conditional rewriting has been studied both from the point of view of algebraic data type specifications and as a computational paradigm combining logic and functional programming. An important issue, in either case, is determining whether a rewrite system has the Church-Rosser, or confluence, property. In this paper, we settle negatively the question whether "joinabihty of critical pairs" is, ...

Term rewriting systems provide a versatile model of computation. An important property which allows to abstract from potential nondeterminism of parallel execution of the modelled program is confluence. In this paper we prove that confluence of a fairly large class of systems, namely right ground term rewriting systems, is decidable. We introduce a labelling of variables with colours and constr...

The notion of confluence is studied on the context of bigraphs. Confluence will be important in modelling real-world systems, both natural (as in biology) and artificial (as in pervasive computing). The paper uses bigraphs in which names have multiple locality; this enables a formulation of the lambda calculus with explicit substitutions. The paper reports work in progress, seeking conditions o...

Decreasing diagrams technique (van Oostrom, 1994) is a technique that can be widely applied to prove confluence of rewrite systems. To directly apply the decreasing diagrams technique to prove confluence of rewrite systems, rule-labelling heuristic has been proposed by van Oostrom (2008). We show how constraints for ensuring confluence of term rewriting systems constructed based on the rule-lab...

1. I n t r o d u c t i o n Many term rewriting systems and their modifications are considered in logic, automated theorem proving, and programming language [2,3,4,6,8,9]. A fundamental property of term rewriting systems is the confluence property. A few sufficient criteria for the confluence are well known [2,3,4,5,8,9]. However, if a term rewriting system is nonterminating and nonlinear, we kn...

It is well known that confluence and strong normalization are preserved when combining algebraic rewriting systems with the simply typed lambda calculus. It is equally well known that confluence fails when adding either the usual contraction rule for η, or recursion together with the usual contraction rule for surjective pairing. We show that confluence and strong normalization are modular prop...