ion: Γ · {x : σ} `F t : τ Γ `F (λx : σ.t) : σ → τ Application: Γ `F s : σ → τ Γ `F t : σ

We present a confluence tool for left-linear term rewrite systems. The tool proves confluence by using Hindley’s commutation theorem together with three commutation criteria, including Church-Rosser modulo associative and/or commutative theories. Despite a small number of its techniques, experiments show that the tool is comparable to recent powerful confluence tools.

Confluence occurs when different trading filters generate signals that point to the same directional move. Using regression analysis, this paper investigates confluence trading signals associated with number preference and price exhaustion, for a sample of Australian stocks. The results show that certain price levels tend to act as psychological barriers, and that price exhaustion signals are a...

In this paper we prove that adding a confluence axiom to a modal logic which behaves rather well from the viewpoint of complexity of the satisfaction problem, drastically increases its complexity and blows it up from PSPACE-completeness to NEXPTIME-completeness. More precisely, we investigate here both monomodal K + confluence and bimodal K with confluence between the two modalities.

The aim of this study was to establish the merging patterns and dispositions of upper biliary confluence and to compare our findings with those of other investigators as applied to liver transplantation. We put our emphasis on the interpretation of our results in relation with the main plane of liver functional division. On 30 postmortem, adult human liver specimens, of subjects of both sexes, ...

The rule labeling heuristic aims to establish confluence of (left-)linear term rewrite systems via decreasing diagrams. We present a formalization of a confluence criterion based on the interplay of relative termination and the rule labeling in the theorem prover Isabelle. Moreover, we report on the integration of this result into the certifier CeTA, facilitating the checking of confluence cert...

Confluence that ensures the uniqueness of results of computation is one of important properties on rewriting systems. In this paper, we show undecidability of confluence for length preserving string rewriting systems (SRSs) and prove it by reducing the Post’s correspondence problem (PCP), which is known to be undecidable, to confluence problem of length preserving string rewriting systems. More...

In order to disprove confluence of term rewriting systems, we develop new criteria for ensuring non-joinability of terms based on interpretation and ordering. We present some instances of the criteria which are amenable for automation, and report on an implementation of a confluence disproving procedure based on these instances. The experiments reveal that our method is successfully applied to ...

A strong confluence result for Q, a quantum λ-calculus with measurements, is proved. More precisely, confluence is shown to hold both for finite and infinite computations. The technique used in the confluence proof is syntactical but innovative. This makes Q different from similar quantum lambda calculi, which are either measurement-free or provided with a reduction strategy.