Volumetric finite-element modelling of biological growth

Differential growth is the driver of tissue morphogenesis in plants, and also plays a fundamental role in animal development. Although the contributions of growth to shape change have been captured through modelling tissue sheets or isotropic volumes, a framework for modelling both isotropic and anisotropic volumetric growth in three dimensions over large changes in size and shape has been lacking. Here, we describe an approach based on finite-element modelling of continuous volumetric structures, and apply it to a range of forms and growth patterns, providing mathematical validation for examples that admit analytic solution. We show that a major difference between sheet and bulk tissues is that the growth of bulk tissue is more constrained, reducing the possibility of tissue conflict resolution through deformations such as buckling. Tissue sheets or cylinders may be generated from bulk shapes through anisotropic specified growth, oriented by a polarity field. A second polarity field, orthogonal to the first, allows sheets with varying lengths and widths to be generated, as illustrated by the wide range of leaf shapes observed in nature. The framework we describe thus provides a key tool for developing hypotheses for plant morphogenesis and is also applicable to other tissues that deform through differential growth or contraction

Observational Equivalence and Full Abstraction in the Symmetric Interaction Combinators

The symmetric interaction combinators are an equally expressive variant of Lafont's interaction combinators. They are a graph-rewriting model of deterministic computation. We define two notions of observational equivalence for them, analogous to normal form and head normal form equivalence in the lambda-calculus. Then, we prove a full abstraction result for each of the two equivalences. This is obtained by interpreting nets as certain subsets of the Cantor space, called edifices, which play the same role as Boehm trees in the theory of the lambda-calculus

Modularity of Convergence and Strong Convergence in Infinitary Rewriting

Properties of Term Rewriting Systems are called modular iff they are preserved under (and reflected by) disjoint union, i.e. when combining two Term Rewriting Systems with disjoint signatures. Convergence is the property of Infinitary Term Rewriting Systems that all reduction sequences converge to a limit. Strong Convergence requires in addition that redex positions in a reduction sequence move arbitrarily deep. In this paper it is shown that both Convergence and Strong Convergence are modular properties of non-collapsing Infinitary Term Rewriting Systems, provided (for convergence) that the term metrics are granular. This generalises known modularity results beyond metric \infty

Transfinite reductions in orthogonal term rewriting systems

Strongly convergent reduction is the fundamental notion of reduction in infinitary orthogonal term rewriting systems (OTRSs). For these we prove the Transfinite Parallel Moves Lemma and the Compressing Lemma. Strongness is necessary as shown by counterexamples. Normal forms, which we allow to be infinite, are unique, in contrast to ω-normal forms. Strongly converging fair reductions result in normal forms. In general OTRSs the infinite Church-Rosser Property fails for strongly converging reductions. However for Böhm reduction (as in Lambda Calculus, subterms without head normal forms may be replaced by ⊥) the infinite Church-Rosser property does hold. The infinite Church-Rosser Property for non-unifiable OTRSs follows. The top-terminating OTRSs of Dershowitz c.s. are examples of non-unifiable OTRSs