On the characterization of models of H*: The semantical aspect

We give a characterization, with respect to a large class of models of untyped lambda-calculus, of those models that are fully abstract for head-normalization, i.e., whose equational theory is H* (observations for head normalization). An extensional K-model $D$ is fully abstract if and only if it is hyperimmune, {\em i.e.}, not well founded chains of elements of D cannot be captured by any recursive function. This article, together with its companion paper, form the long version of [Bre14]. It is a standalone paper that presents a purely semantical proof of the result as opposed to its companion paper that presents an independent and purely syntactical proof of the same result

Relational Graph Models at Work

We study the relational graph models that constitute a natural subclass of relational models of lambda-calculus. We prove that among the lambda-theories induced by such models there exists a minimal one, and that the corresponding relational graph model is very natural and easy to construct. We then study relational graph models that are fully abstract, in the sense that they capture some observational equivalence between lambda-terms. We focus on the two main observational equivalences in the lambda-calculus, the theory H+ generated by taking as observables the beta-normal forms, and H* generated by considering as observables the head normal forms. On the one hand we introduce a notion of lambda-K\"onig model and prove that a relational graph model is fully abstract for H+ if and only if it is extensional and lambda-K\"onig. On the other hand we show that the dual notion of hyperimmune model, together with extensionality, captures the full abstraction for H*

Predicativity, the Russell-Myhill Paradox, and Church's Intensional Logic

This paper sets out a predicative response to the Russell-Myhill paradox of propositions within the framework of Church's intensional logic. A predicative response places restrictions on the full comprehension schema, which asserts that every formula determines a higher-order entity. In addition to motivating the restriction on the comprehension schema from intuitions about the stability of reference, this paper contains a consistency proof for the predicative response to the Russell-Myhill paradox. The models used to establish this consistency also model other axioms of Church's intensional logic that have been criticized by Parsons and Klement: this, it turns out, is due to resources which also permit an interpretation of a fragment of Gallin's intensional logic. Finally, the relation between the predicative response to the Russell-Myhill paradox of propositions and the Russell paradox of sets is discussed, and it is shown that the predicative conception of set induced by this predicative intensional logic allows one to respond to the Wehmeier problem of many non-extensions.Comment: Forthcoming in The Journal of Philosophical Logi

Intensional and Extensional Semantics of Bounded and Unbounded Nondeterminism

We give extensional and intensional characterizations of nondeterministic functional programs: as structure preserving functions between biorders, and as nondeterministic sequential algorithms on ordered concrete data structures which compute them. A fundamental result establishes that the extensional and intensional representations of non-deterministic programs are equivalent, by showing how to construct a unique sequential algorithm which computes a given monotone and stable function, and describing the conditions on sequential algorithms which correspond to continuity with respect to each order. We illustrate by defining may and must-testing denotational semantics for a sequential functional language with bounded and unbounded choice operators. We prove that these are computationally adequate, despite the non-continuity of the must-testing semantics of unbounded nondeterminism. In the bounded case, we prove that our continuous models are fully abstract with respect to may and must-testing by identifying a simple universal type, which may also form the basis for models of the untyped lambda-calculus. In the unbounded case we observe that our model contains computable functions which are not denoted by terms, by identifying a further "weak continuity" property of the definable elements, and use this to establish that it is not fully abstract

Monoidal computer III: A coalgebraic view of computability and complexity

Monoidal computer is a categorical model of intensional computation, where many different programs correspond to the same input-output behavior. The upshot of yet another model of computation is that a categorical formalism should provide a much needed high level language for theory of computation, flexible enough to allow abstracting away the low level implementation details when they are irrelevant, or taking them into account when they are genuinely needed. A salient feature of the approach through monoidal categories is the formal graphical language of string diagrams, which supports visual reasoning about programs and computations. In the present paper, we provide a coalgebraic characterization of monoidal computer. It turns out that the availability of interpreters and specializers, that make a monoidal category into a monoidal computer, is equivalent with the existence of a *universal state space*, that carries a weakly final state machine for any pair of input and output types. Being able to program state machines in monoidal computers allows us to represent Turing machines, to capture their execution, count their steps, as well as, e.g., the memory cells that they use. The coalgebraic view of monoidal computer thus provides a convenient diagrammatic language for studying computability and complexity.Comment: 34 pages, 24 figures; in this version: added the Appendi

Polymeric filament thinning and breakup in microchannels

The effects of elasticity on filament thinning and breakup are investigated in microchannel cross flow. When a viscous solution is stretched by an external immiscible fluid, a low 100 ppm polymer concentration strongly affects the breakup process, compared to the Newtonian case. Qualitatively, polymeric filaments show much slower evolution, and their morphology features multiple connected drops. Measurements of filament thickness show two main temporal regimes: flow- and capillary-driven. At early times both polymeric and Newtonian fluids are flow-driven, and filament thinning is exponential. At later times, Newtonian filament thinning crosses over to a capillary-driven regime, in which the decay is algebraic. By contrast, the polymeric fluid first crosses over to a second type of flow-driven behavior, in which viscoelastic stresses inside the filament become important and the decay is again exponential. Finally, the polymeric filament becomes capillary-driven at late times with algebraic decay. We show that the exponential flow thinning behavior allows a novel measurement of the extensional viscosities of both Newtonian and polymeric fluids.Comment: 7 pages, 7 figure

The concept of "character" in Dirichlet's theorem on primes in an arithmetic progression

In 1837, Dirichlet proved that there are infinitely many primes in any arithmetic progression in which the terms do not all share a common factor. We survey implicit and explicit uses of Dirichlet characters in presentations of Dirichlet's proof in the nineteenth and early twentieth centuries, with an eye towards understanding some of the pragmatic pressures that shaped the evolution of modern mathematical method

Flow of low viscosity Boger fluids through a microfluidic hyperbolic contraction

In this work we focus on the development of low viscosity Boger fluids and assess their elasticity analyzing the flow through a microfluidic hyperbolic contraction. Rheological tests in shear and extensional flows were carried out in order to evaluate the effect of the addition of a salt (NaCl) to dilute aqueous solutions of polyacrylamide at 400, 250, 125 and 50 ppm (w/w). The rheological data showed that when 1% (w/w) of NaCl was added, a significant decrease of the shear viscosity curve was observed, and a nearly constant shear viscosity was found for a wide range of shear rates, indicating Boger fluid behavior. The relaxation times, measured using a capillary break-up extensional rheometer (CaBER), decreased for lower polymer concentrations, and with the addition of NaCl. Visualizations of these Boger fluids flowing through a planar microfluidic geometry containing a hyperbolic contraction, which promotes a nearly uniform extension rate at the centerline of the geometry, was important to corroborate their degree of elasticity. Additionally, the quantification of the vortex growth upstream of the hyperbolic contraction was used with good accuracy and reproducibility to assess the relaxation time for the less concentrated Boger fluids, for which CaBER measurements are difficult to perform