Fungi Associated with the Hemlock Woolly Adelgid, Adelges tsugae, and Assessment of Entomopathogenic Isolates for Management

Fungi associated with the hemlock wooly adelgid, Adelges tsugae Annand (Hemiptera: Adelgidae), were collected throughout the eastern USA and southern China. Twenty fungal genera were identified, as were 79 entomopathogenic isolates, including: Lecanicillium lecanii (Zimmermann) (Hypocreales: Insertae sedis), Isaria farinosa (Holm: Fries.) (Cordycipitaceae), Beauveria bassiana (Balasamo) (Hyphomycetes), and Fusarium spp (Nectriaceae). The remaining fungal genera associated with insect cadavers were similar for both the USA and China collections, although the abundance of Acremonium (Hypocreaceae) was greater in China. The entomopathogenic isolates were assayed for efficacy against Myzus persicae (Sulzer) (Homoptera: Aphididae) and yielded mortality ranging from 3 to 92%. Ten isolates demonstrating the highest efficacy were further assessed for efficacy against field-collected A. tsugae under laboratory conditions. Overall, two B. bassiana, one L. lecanii, and a strain of Metarhizium anisopliae (Metchnikoff) (Hypocreales: Clavicipitaceae), demonstrated significantly higher efficacy against A. tsugae than the others. Isolates were further evaluated for conidial production, germination rate and colony growth at four temperatures representative of field conditions. All isolates were determined to be mesophiles with optimal temperature between 25–30° C. In general, conidial production increased with temperature, though two I. farinosa produced significantly more conidia at cooler temperatures. When efficacy values were compared with conidial production and temperature tolerances, Agricultural Research Service Collection of Entomopathogenic Fungi (ARSEF) 1080, 5170, and 5798 had characteristics comparable to the industrial B. bassiana strain GHA

Some History of Functional Programming Languages

We study a series of milestones leading to the emergence of lazy, higher order, polymorphically typed, purely functional programming languages. An invited lecture given at TFP12, St Andrews University, 12 June 2012

Sound and Complete Typing for lambda-mu

In this paper we define intersection and union type assignment for Parigot's calculus lambda-mu. We show that this notion is complete (i.e. closed under subject-expansion), and show also that it is sound (i.e. closed under subject-reduction). This implies that this notion of intersection-union type assignment is suitable to define a semantics.Comment: In Proceedings ITRS 2010, arXiv:1101.410

Handlers of Algebraic Effects

Abstract. We present an algebraic treatment of exception handlers and, more generally, introduce handlers for other computational effects representable by an algebraic theory. These include nondeterminism, interactive input/output, concurrency, state, time, and their combinations; in all cases the computation monad is the free-model monad of the theory. Each such handler corresponds to a model of the theory for the effects at hand. The handling construct, which applies a handler to a computation, is based on the one introduced by Benton and Kennedy, and is interpreted using the homomorphism induced by the universal property of the free model. This general construct can be used to describe previously unrelated concepts from both theory and practice.

Autoantibodies against type I IFNs in patients with life-threatening COVID-19

Interindividual clinical variability in the course of severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) infection is vast. We report that at least 101 of 987 patients with life-threatening coronavirus disease 2019 (COVID-19) pneumonia had neutralizing immunoglobulin G (IgG) autoantibodies (auto-Abs) against interferon-w (IFN-w) (13 patients), against the 13 types of IFN-a (36), or against both (52) at the onset of critical disease; a few also had auto-Abs against the other three type I IFNs. The auto-Abs neutralize the ability of the corresponding type I IFNs to block SARS-CoV-2 infection in vitro. These auto-Abs were not found in 663 individuals with asymptomatic or mild SARS-CoV-2 infection and were present in only 4 of 1227 healthy individuals. Patients with auto-Abs were aged 25 to 87 years and 95 of the 101 were men. A B cell autoimmune phenocopy of inborn errors of type I IFN immunity accounts for life-threatening COVID-19 pneumonia in at least 2.6% of women and 12.5% of men

A rewriting semantics for type inference

Abstract. When students first learn programming, they often rely on a simple operational model of a program’s behavior to explain how particular features work. Because such models build on their earlier training in algebra, students find them intuitive, even obvious. Students learning type systems, however, have to confront an entirely different notation with a different semantics that many find difficult to understand. In this work, we begin to build the theoretical underpinnings for treating typechecking in a manner like the operational semantics of execution. Intuitively, each term is incrementally rewritten to its type. For example, each basic constant rewrites directly to its type and each lambda expression rewrites to an arrow type whose domain is the type of the lambda’s formal parameter and whose range is the body of the lambda expression which, in turn, rewrites to the range type.

A LOTOS Based Tutorial on Formal Methods for Object Oriented Distributed Systems

The majority of formal methods for distributed systems have their origins in the 1980's and were targeted at the early generations of distributed systems. However, modern distributed systems have new features not found in the early systems, e.g. they are object-oriented, have mobile components, are time sensitive and are constructed according to advanced system development architectures, e.g. viewpoints models. A major topic of current research is thus, how to enhance the existing formal techniques in order to support these new features. This paper gives a tutorial level review of this research area. We particularly focus on the process algebra LOTOS and consider how the technique can be reconciled with these new features