In order to alleviate the inefficiencies caused by the interaction of the logic and functional sides, integrated languages may take advantage of demand information — i.e. knowing in advance which computations are needed and, to which extent, in a particular context. This work studies demand analysis – which is closely related to backwards strictness analysis – in a semantic framework of partial...

The aim of the present study was to evaluate the association between parenting styles and own fruit and vegetable consumption among Portuguese mothers of school children. A cross-sectional study was performed in Portugal as part of the Pro Children cross-sectional European survey. Portuguese mothers (n 1601) of 11-13-year-old school children were included in the present study. A self-administer...

The class NPkV consists of those partial, multivalued functions that can be computed by a nondeterministic, polynomial time-bounded transducer that has at most k distinct values on any input. We define the output-multiplicity hierarchy to consist of the collection of classes NPkV, for all positive integers k 1. In this paper we investigate the strictness of the output-multiplicity hierarchy and...

Building on Kahn and Plotkin's theory of concrete data structures and sequential functions, Berry and Curien de ned an intensional model of sequential algorithms between concrete data structures. In this paper we report on an attempt to develop a similar intensional model of concurrent computation. We present a notion of parallel algorithm between concrete data structures, together with suitabl...

Recently there has been much interest in the abstract interpretation of declarative languages. Abstract interpretation is a semantics-based approach to program analysis that uses compile time evaluation of programs using simplified value domains. This gives information about the run-time properties of programs and provides the basis for significant performance improvements. A particular example...

the islamic law considers people’s financial affairs as important and has devised special rules for it so that the citizens may live under their protection. strictness on the usurper of other people’s properties is part of these rules so that no one would dare to encroach upon other people’s properties. this strictness in confronting the usurpers of rights is implied from the traditions and rul...

The expressive power of compositions of linear extended topdown tree transducers with and without regular look-ahead is investigated. In particular, the restrictions of ε-freeness, strictness, and nondeletion are considered. The composition hierarchy is finite for all ε-free variants of these transducers except for ε-free nondeleting linear extended top-down tree transducers. The least number o...

In a non-strict functional programming language functions that yield the same result for all total arguments can still differ for partial arguments, that is, they differ in their strictness. Here a Haskell library is presented that enables the programmer to easily check whether a given function is least-strict; if it is not least-strict, then the tool suggests how to make it less strict.

Orthodoxy has it that counterfactuals cannot be treated as strict conditionals. But there is a loophole: if the strictness is a function of context then maybe they can be so treated. I argue for a loophole analysis that treats ‘would’-counterfactuals as strict conditionals that are duals to ‘might’counterfactuals. Most of the work lies in getting straight about the interaction between context a...