Strictness analysis (at least for at domains) is well understood. For a few years the main concern was eeciency, since the standard analysis was shown to be exponential in the worst case 9]. Thus lots of research evolved to nd eecient average-case algorithms. In Yale Haskell we have implemented a strictness analyzer that computes x-points via symbolic manipulation of boolean functions. This ext...

Building off of Dean Kelley’s and Laurence Iannaccone’s earlier work, we develop a path model of the strictness thesis that investigates and compares how congregational strictness, evangelical theology, demographic characteristics, and denominational identity variously contribute to congregational growth and decline. Using the U.S. Congregational Life Survey (2001), we test this model at the co...

Objective: This study analyzes whether parental strictness, which is shared by authoritative parenting (strictness and warmth) authoritarian without styles, always acts as a main protective factor against drug use psychosocial maladjustment in children. conclusion has already been stated numerous classic studies, though emergent research suggests that there are benefits to warmth regardless of ...

A substantial amount of work has been devoted to the proof of correctness of various program analyses but much less attention has been paid to the correctness of compiler optimisations based on these analyses. In this paper we tackle the problem in the context of strictness analysis for lazy functional languages. We show that compiler optimisations based on strictness analysis can be expressed ...

What is a non-strict functional language? Is a non-strict language necessarily lazy? What additional expressiveness brings non-strictness, with or without laziness? This paper tries to shed some light on these questions. First, in order to characterize non-strictness, di1erent evaluation strategies are introduced: strict, lazy, and lenient. Then, using program examples, how these evaluation str...

Strictness analysis can be used for automatic parallelization of lazy functional programs while preserving their semantics (and termination properties, in particular). This paper considers ways of exploiting strictness analysis in implementing functional languages eeciently on stock parallel hardware. A strictness{based parallel evaluation model is presented, and is compared with the more gener...

Beginning with Kelley’s and Iannaccone’s foundational studies, scholars have examined how strictness impacts congregational outcomes. This paper seeks to further develop the strict church thesis by examining Iannaccone’s concept of “optimal level of strictness”, an idea that there are limits to strictness. Using Stark and Finke’s theoretical framework of religious niches and data from the 2005 ...

Coppo, M. and A. Ferrari, Type inference, abstract interpretation and strictness analysis, Theoretical Computer Science 121 (1993) 113-143. Filter domains (Coppo et al., 1984) can be seen as abstract domains for the interpretation of (functional) type-free programming languages. What is remarkable is the fact that in filter domains the interpretation of a term is given by the set of its types i...

Explicitly enforcing strictness is often used by functional programmers as an important tool for making applications fit time and space efficiency requirements. Few functional programmers however, are familiar with the consequences of explicitly enforcing strictness for formal reasoning about their programs. Some “folklore” knowledge has emerged but this is based on experience rather than on ri...