We address the problem of complementing higher-order patterns without repetitions of free variables. Di erently from the rst-order case, the complement of a pattern cannot, in general, be described by a pattern, or even by a nite set of patterns. We therefore generalize the simply-typed -calculus to include an internal notion of strict function so that we can directly express that a term must d...

The purpose of this department is to provide early announcement of significant new results, with some indications of proof. Although ordinarily a research announcement should be a brief summary of a paper to be published in full elsewhere, papers giving complete proofs of results of exceptional interest are also solicited. Manuscripts more than eight typewritten double spaced pages long will no...

This paper establishes a strong completeness property of compositional program logics for pure and imperative higher-order functions introduced in [2, 15–18]. This property, called descriptive completeness, says that for each program there is an assertion fully describing the former’s behaviour up to the standard observational semantics. This formula is inductively calculable from the program t...

The relative worst order ratio is a measure for the quality of online algorithms. Unlike the competitive ratio, it compares algorithms directly without involving an optimal offline algorithm. The measure has been successfully applied to problems like paging and bin packing. In this paper, we apply it to machine scheduling. We show that for preemptive scheduling, the measure separates multiple p...

The paper reports on a perception experiment in German investigating the relative prominence of target words in two positions in a sentence. Listeners judged for each position which of four prominence levels were perceived as accented or unaccented. While subjects clearly distinguished between strongly accented and unaccented (i.e. postlexically stressed and unstressed) words in both positions,...

For each k, let P k be the product of the rst k primes. By the Chinese remainder theorem, each integer in the interval 0;P k) is determined by its residues modulo these k primes. We address the problems of space-eeciently computing the bits and the relative order of such numbers from their residues.

By integrating constructs from the λ-calculus and the π-calculus, in higher-order process calculi exchanged values may contain processes. This paper studies the relative expressiveness of HOπ, the higher-order π-calculus in which communications are governed by session types. Our main discovery is that HO, a subcalculus of HOπ which lacks name-passing and recursion, can serve as a new core calcu...

This work proposes tractable bisimulations for the higher-order πcalculus with session primitives (HOπ) and offers a complete study of the expressivity of its most significant subcalculi. First we develop three typed bisimulations, which are shown to coincide with contextual equivalence. These characterisations demonstrate that observing as inputs only a specific finite set of higher-order valu...

The judgement of relative order (JOR) procedure is used to investigate serial-order memory. Measuring response times, the wording of the instructions (whether the earlier or the later item was designated as the target) reversed the direction of search in subspan lists (Chan, Ross, Earle, & Caplan Psychonomic Bulletin & Review, 16(5), 945-951, 2009). If a similar congruity effect applied to abov...