Set-Theoretic Types for Polymorphic Variants

Polymorphic variants are a useful feature of the OCaml language whose current definition and implementation rely on kinding constraints to simulate a subtyping relation via unification. This yields an awkward formalization and results in a type system whose behaviour is in some cases unintuitive and/or unduly restrictive. In this work, we present an alternative formalization of poly-morphic variants, based on set-theoretic types and subtyping, that yields a cleaner and more streamlined system. Our formalization is more expressive than the current one (it types more programs while preserving type safety), it can internalize some meta-theoretic properties, and it removes some pathological cases of the current implementation resulting in a more intuitive and, thus, predictable type system. More generally, this work shows how to add full-fledged union types to functional languages of the ML family that usually rely on the Hindley-Milner type system. As an aside, our system also improves the theory of semantic subtyping, notably by proving completeness for the type reconstruction algorithm.Comment: ACM SIGPLAN International Conference on Functional Programming, Sep 2016, Nara, Japan. ICFP 16, 21st ACM SIGPLAN International Conference on Functional Programming, 201

Contracts for Abstract Processes in Service Composition

Contracts are a well-established approach for describing and analyzing behavioral aspects of web service compositions. The theory of contracts comes equipped with a notion of compatibility between clients and servers that ensures that every possible interaction between compatible clients and servers will complete successfully. It is generally agreed that real applications often require the ability of exposing just partial descriptions of their behaviors, which are usually known as abstract processes. We propose a formal characterization of abstraction as an extension of the usual symbolic bisimulation and we recover the notion of abstraction in the context of contracts.Comment: In Proceedings FIT 2010, arXiv:1101.426

Ground-Penetrating Radar Theory and Application of Thin-Bed Offset-Dependent Reflectivity

Offset-dependent reflectivity or amplitude-variationwith- offset (AVO) analysis of ground-penetrating radar (GPR) data may improve the resolution of subsurface dielectric permittivity estimates. A horizontally stratified medium has a limiting layer thickness below which thin-bed AVO analysis is necessary. For a typical GPR signal, this limit is approximately 0.75 of the characteristic wavelength of the signal. Our approach to modeling the GPR thin-bed response is a broadband, frequency-dependent computation that utilizes an analytical solution to the three-interface reflectivity and is easy to implement for either transverse electric (TE) or transverse magnetic (TM) polarizations. The AVO curves for TE and TM modes differ significantly. In some cases, constraining the interpretation using both TE and TM data is critical. In two field examples taken from contaminated-site characterization data, we find quantitative thin-bed modeling agrees with the GPR field data and available characterization data

Resolving Non-Determinism in Choreographies

Resolving non-deterministic choices of choreographies is a crucial task. We introduce a novel notion of realisability for choreographies –called whole-spectrum implementation– that rules out deterministic implementations of roles that, no matter which context they are placed in, will never follow one of the branches of a non-deterministic choice. We show that, under some conditions, it is decidable whether an implementation is whole-spectrum. As a case study, we analyse the POP protocol under the lens of whole-spectrum implementation

Deriving Bisimulation Congruences: 2-categories vs precategories

G-relative pushouts (GRPOs) have recently been proposed by the authors as a new foundation for Leifer and Milner’s approach to deriving labelled bisimulation congruences from reduction systems. This paper develops the theory of GRPOs further, arguing that they provide a simple and powerful basis towards a comprehensive solution. As an example, we construct GRPOs in a category of ‘bunches and wirings.’ We then examine the approach based on Milner’s precategories and Leifer’s functorial reactive systems, and show that it can be recast in a much simpler way into the 2-categorical theory of GRPOs

Chemical induction of spawning by serotonin in the ocean quahog Arctica islandica (Linne)

Serotonin injected into the anterior adductor muscle induced spawning in the ocean quahog Arcrica islandica (Linne) when using either individual or mass spawning techniques. This represents the fir st successful attempt to induce the release of gametes in this species which historically has been unresponsive to conventional spawning stimuli. The gametes released were competent and fertilization occurred without treating the encapsulated eggs with ammonium hydroxide or other chemicals. Larvae were reared through metamorphosis to early juvenile stage

A scalable algorithm for many-body dissipative particle dynamics using multiple general purpose graphic processing units

We present a novel algorithm for the many-body Dissipative Particle Dynamics (DPD) forces calculation which allows to efficiently scale the DL_MESO software package on Multiple General Purpose Graphic Processing Units. Together with the extension to 64-bit integer arrays and addition of hard surface boundary conditions, the proposed algorithm allows to simulate very large complex mesoscale systems up to 14 billion beads. The implementation takes advantages of the CUDA language stream features to overlap the exchange of particle positions and local densities and the computation of the short range forces. We tested a water drop between two plates system using tree of the main European supercomputers: Piz Daint, Marconi and JUWELS. Results shows an improvement on the speedup compared to a naive implementation up to 1.5x when using 1024 GPUs

Preliminary observations on the usefulness of hinge structures for identification of bivalve larvae

Difficulties associated with discrimination of bivalve larvae isolated from plankton samples have long hampered both applied and basic research efforts in estuarine and open coastal marine environments. The vast majority of practical barriers to identification of larval bivalves may be eliminated through routine optical microscopic examination of the hinge apparatus of disarticulated larval shells. Representative micrographs of various ontogenetic stages of larval hinge development are presented for 12 genera (Mytilus, Geukensia, Crassostrea, Placopecten. Argopecten. Mya, Spisula, Mulinia, Ensis, Arca, Arctica. and Mercenaria) from 9 bivalve superfamilies (Mytilacea, Ostreacea. Pectinacea, Myacea, Mactracea. Solenacea, Arcacea, Arcticacea. and Veneracea). The larval hinge apparatus (provinculum). by itself is generally useful for superfamilial separation. When coupled with a consideration of gross shell shape, detailed examination of hinge line structures often permits generic or even specific, identification. A format is suggested for organization of qualitative morphological life history data that will provide an adeqate basis for comparison of the larval stages of various species of bivalves