The confluence model explains birth-order differences in intellectual performance by quantifying the changing dynamics within the family. Wichman, Rodgers, and MacCallum (2006) claimed that these differences are a between-family phenomenon--and hence are not directly related to birth order itself. The study design and analyses presented by Wichman et al. nevertheless suffer from crucial shortco...

The confluence of untyped λ-calculus with unconditional rewriting is now well understood. In this paper, we investigate the confluence of λ-calculus with conditional rewriting and provide general results in two directions. First, when conditional rules are algebraic. This extends results of Müller and Dougherty for unconditional rewriting. Two cases are considered, whether betareduction is allo...

Benzo[a]pyrene (BaP) is potent rodent carcinogen and a reputed human carcinogen. Although much is known about its metabolic activation leading to DNA damage, the mechanisms of its actions are not as well understood at a cellular level. In addressing this, we have established an in vitro model that follows the progression toward neoplastic transformation induced by BaP. The model uses immortal n...

We give a method to prove confluence of term rewriting systems that contain non-terminating rewrite rules such as commutativity and associativity. Usually, confluence of term rewriting systems containing such rules is proved by treating them as equational term rewriting systems and considering E-critical pairs and/or termination modulo E. In contrast, our method is based solely on usual critica...

We give a method to prove confluence of term rewriting systems that contain non-terminating rewrite rules such as commutativity and associativity. Usually, confluence of term rewriting systems containing such rules is proved by treating them as equational term rewriting systems and considering E-critical pairs and/or termination modulo E. In contrast, our method is based solely on usual critica...

The confluence of untyped λ-calculus with unconditional rewriting is now well understood. In this paper, we investigate the confluence of λ-calculus with conditional rewriting and provide general results in two directions. First, when conditional rules are algebraic. This extends results of Müller and Dougherty for unconditional rewriting. Two cases are considered, whether betareduction is allo...

We consider the application of Constraint Handling Rules (CHR) for the specification of type inference systems, such as that used by Haskell. Confluence of CHR guarantees that the answer provided by type inference is correct and consistent. The standard method for establishing confluence relies on an assumption that the CHR program is terminating. However, many examples in practice give rise to...

We develop a theory of confluence of graphs. We describe an algorithm for proving that a given system of reduction rules for abstract graphs and graphs in surfaces is locally confluent. We apply this algorithm to show that each simple Lie algebra of rank at most 2, gives rise to a confluent system of reduction rules of graphs (via Kuperberg’s spiders) in an arbitrary surface. As a further conse...

CeTA was originally developed as a tool for certifying termination proofs [5] which have to be provided as certificates in the CPF-format. Its soundness is proven within IsaFoR, the Isabelle Formalization of Rewriting. In the meantime, CeTA can also be used as a tool for certifying confluence and non-confluence proofs. In the following system description, we give a short overview on what kind o...

We present a polynomial time algorithm for deciding confluence of ground term rewrite systems. We generalize the decision procedure to get a polynomial time algorithm, assuming that the maximum arity of a symbol in the signature is a constant, for deciding confluence of rewrite systems where each rule contains a shallow linear term on one side and a ground term on the other. The existence of a ...