Introducing a Calculus of Effects and Handlers for Natural Language Semantics

In compositional model-theoretic semantics, researchers assemble truth-conditions or other kinds of denotations using the lambda calculus. It was previously observed that the lambda terms and/or the denotations studied tend to follow the same pattern: they are instances of a monad. In this paper, we present an extension of the simply-typed lambda calculus that exploits this uniformity using the recently discovered technique of effect handlers. We prove that our calculus exhibits some of the key formal properties of the lambda calculus and we use it to construct a modular semantics for a small fragment that involves multiple distinct semantic phenomena

Definition, technology readiness, and development cost of the orbit transfer vehicle engine integrated control and health monitoring system elements

An Integrated Control and Health Monitoring (ICHM) system was conceived for use on a 20 Klb thrust baseline Orbit Transfer Vehicle (OTV) engine. Considered for space used, the ICHM was defined for reusability requirements for an OTV engine service free life of 20 missions, with 100 starts and a total engine operational time of 4 hours. Functions were derived by flowing down requirements from NASA guidelines, previous OTV engine or ICHM documents, and related contracts. The elements of an ICHM were identified and listed, and these elements were described in sufficient detail to allow estimation of their technology readiness levels. These elements were assessed in terms of technology readiness level, and supporting rationale for these assessments presented. The remaining cost for development of a minimal ICHM system to technology readiness level 6 was estimated. The estimates are within an accuracy range of minus/plus 20 percent. The cost estimates cover what is needed to prepare an ICHM system for use on a focussed testbed for an expander cycle engine, excluding support to the actual test firings

Resource partitioning among African savanna herbivores in North Cameroon: the importance of diet composition, food quality and body mass

The relationship between herbivore diet quality, and diet composition (the range of food plants consumed) and body mass on resource partitioning of herbivores remains the subject of an ongoing scientific debate. In this study we investigated the importance of diet composition and diet quality on resource partitioning among eight species of savanna herbivore in north Cameroon, with different body mass. Dung samples of four to seven wild herbivore and one domesticated species were collected in the field during the dry and wet period. Diet composition was based on microhistological examination of herbivore droppings, epidermis fragments were identified to genus or family level. In addition, the quality of the faecal droppings was determined in terms of phosphorus, nitrogen and fibre concentrations. The results showed that there was no significant correlation between body mass and (differences in) diet composition for wet and dry season. When all species are considered, only significant relationships are found by the Spearman rank correlation analyses during the wet season between body mass and phosphorus and nitrogen, but this relationship did not exist during the dry season. When the analyses focuses on ruminants only (thus leaving out hippo), none of the relationships between body mass and diet quality was significant in either season. During the dry season the proportion of graminoids ranged between 10% (small unidentified herbivore species) to 90% (hippopotamus), during the wet season this proportion ranged from 60% (zebu) to 90% (hippopotamus). All species but zebu had more graminoids in their dung during wet season compared with dry season. However all species but hartebeest had more graminoids old stems in their dung during the dry season, compared with the wet season. The niche breadth for food categories consumed by kob (0.300), hippo (0.090), hartebeest (0.350), roan (0.510) and zebu (0.300) was much greater in the dry season than in the wet season for kob (0.120), hippo (0.020), hartebeest (0.190), roan (0.090) and zebu (0.200). When looking at grass taxa consumed, the niche breadth of kob (0.220), hartebeest (0.140), and roan (0.250) was also greater in the dry season when compared with the wet season for kob (0.050), hartebeest (0.120) and roan (0.120). The opposite was found for zebu and hippo. Comparison of the species’ diet compositions with randomized data showed that dietary overlap between different herbivore species was much higher than what would be expected on the basis of chance, demonstrating surprisingly limited niche separation between species. This offers potential for competition, but it is more likely that the high niche overlap indicates absence of competition, due to low herbivore densities and abundant food resources, permitting species to share non-limiting resources. With increasing herbivore densities and subsequent increasing scarcity of resources, the relationship between diet quality and body mass in combination with increased niche separation is expected to become more visibl

Braids via term rewriting

We present a brief introduction to braids, in particular simple positive braids, with a double emphasis: first, we focus on term rewriting techniques, in particular, reduction diagrams and decreasing diagrams. The second focus is our employment of the colored braid notation next to the more familiar Artin notation. Whereas the latter is a relative, position dependent, notation, the former is an absolute notation that seems more suitable for term rewriting techniques such as symbol tracing. Artin's equations translate in this notation to simple word inversions. With these points of departure we treat several basic properties of positive braids, in particular related to the word problem, confluence property, projection equivalence, and the congruence property. In our introduction the beautiful diamond known as the permutohedron plays a decisive role

Efficient Pattern Matching in Python

Pattern matching is a powerful tool for symbolic computations. Applications include term rewriting systems, as well as the manipulation of symbolic expressions, abstract syntax trees, and XML and JSON data. It also allows for an intuitive description of algorithms in the form of rewrite rules. We present the open source Python module MatchPy, which offers functionality and expressiveness similar to the pattern matching in Mathematica. In particular, it includes syntactic pattern matching, as well as matching for commutative and/or associative functions, sequence variables, and matching with constraints. MatchPy uses new and improved algorithms to efficiently find matches for large pattern sets by exploiting similarities between patterns. The performance of MatchPy is investigated on several real-world problems

Decreasing diagrams with two labels are complete for confluence of countable systems

Like termination, confluence is a central property of rewrite systems. Unlike for termination, however, there exists no known complexity hierarchy for confluence. In this paper we investigate whether the decreasing diagrams technique can be used to obtain such a hierarchy. The decreasing diagrams technique is one of the strongest and most versatile methods for proving confluence of abstract reduction systems, it is complete for countable systems, and it has many well-known confluence criteria as corollaries. So what makes decreasing diagrams so powerful? In contrast to other confluence techniques, decreasing diagrams employ a labelling of the steps ? with labels from a well-founded order in order to conclude confluence of the underlying unlabelled relation. Hence it is natural to ask how the size of the label set influences the strength of the technique. In particular, what class of abstract reduction systems can be proven confluent using decreasing diagrams restricted to 1 label, 2 labels, 3 labels, and so on? Surprisingly, we find that two labels su ce for proving confluence for every abstract rewrite system having the cofinality property, thus in particular for every confluent, countable system. We also show that this result stands in sharp contrast to the situation for commutation of rewrite relations, where the hierarchy does not collapse. Finally, as a background theme, we discuss the logical issue of first-order definability of the notion of confluence

Transducer degrees: atoms, infima and suprema

Although finite state transducers are very natural and simple devices, surprisingly little is known about the transducibility relation they induce on streams (infinite words). We collect some intriguing problems that have been unsolved since several years. The transducibility relation arising from finite state transduction induces a partial order of stream degrees, which we call Transducer degrees, analogous to the well-known Turing degrees or degrees of unsolvability. We show that there are pairs of degrees without supremum and without infimum. The former result is somewhat surprising since every finite set of degrees has a supremum if we strengthen the machine model to Turing machines, but also if we weaken it to Mealy machines