“There are many purposes for which we may be interested in the text, in what people actually do and mean and say, in real situations. But in order to make sense of the text, what the speaker actually says, we have to interpret it against the background of what he ‘can say’. In other words, we see the text as actualized potential. ” [his italics]

librarianship is concerned with impediments to access. Through analysis of arguments in the West Bend (WI) chal-lenge case, this article explores three themes in challengers ’ narrow definitions of censorship found in their discourse. First, challengers argue that moving books within the library

-order functional logic programs due to its optimality properties w.r.t. the length of derivations and the number of computed solutions. In this paper, we extend the needed narrowing strategy to higher-order functions and λ-terms as data structures. By the use of definitional trees, our strategy computes only

or gla-brous, 60–180cm high; basal leaves ovate to ovate-lanceolate, acute, coarsely or sharply serrate, petioles up to 25cm long, blades to 20cm long and 15cm wide, blade abruptly narrowing to base, often cordate, decurrent on petiole, 3–5 veined; cauline leaves petiolate below, sessile above, 7–20cm

Biological phenomenon. Spike-timing dependent plasticity (STDP) in its narrow sense refers to the change in the synaptic strength as a result of electrically eliciting pairs of action potentials (‘spikes’) with a fixed time difference between the pre- and post-synaptic action potentials (Markram et

Abstract. This paper describes how high level implementations of (needed) narrowing into Prolog can be improved by introducing a refined representation of definitional trees that handles properly the knowledge about the inductive positions of a pattern. We define some generic algorithms that allow

rewriting strategy by using Antoy’s definitional trees. We show that the resulting strategy computes only needed redexes and develops optimal derivations w.r.t. the number of steps. Finally, we tackle the graph narrowing relation over admissible graphs and propose a sequential narrowing strategy which

To assess young children’s literacy knowledge accurately, it is useful, if not necessary, to have a clear definition of the behaviors to be assessed. Examination of the early and emergent literacy research shows that there are both broad and narrow definitions of

Most definitions of management1 are not specific as to who is doing what. They tend to be limited to a broader or narrower description of management tasks. Broader definitions are those which describe manage-ment as almost any activity that aims at con-servation and sustainable utilization (Jensen

We describe the implementation of needed narrowing deployed in a compiler of a functional-logic language and present a few related concepts and results. Our implementation is obtained by translating rewrite rules into Prolog source code and optionally applying a set of optimizations to this code