We describe several database consistency conditions that restrict ongoing transactions (which might later be aborted), and relate them to known consistency conditions for transactional memory. In particular, we show that rigorousness is strictly stronger than opacity, but strictness is incomparable to opacity. The same relationships also hold for virtual world consistency. We also show that all...

In this paper we define the functional language POLYREC with polymorphic and recursive types, and develop concrete and abstract interpretations for this language. These semantics, based on complete partial orderings and complete lattices, are subsequently used for definition and analysis of strictness. 1980 Mathematical Subject Classification (1985): 03B40, 68N15 1986 CR Classification System.:...

A system of annotated types is proposed as a means of describing and inferring static information, such as strictness and constancy, about functional programs. An abstract semantics is given in terms of projections. A close connection between annotated type assignment and projection analysis is demonstrated.

The present study analyzes the relationship between parental socialization practices, acceptance/involvement, and strictness/imposition, different indicators of adolescent adjustment, taking into account role family self-esteem. A sample 848 Spanish adolescents (54.70% females) ranging in age from 14 to 18 years old (M = 16.11, SD 1.10) participated study. series structural equations models (SE...

In this paper we exhibit a condition on the syntax of the logic programs with negation, the semi-strictness property, which assures the equivalence of the well founded semantics and the stable semantics: so, for semi-strict programs the well founded model is total if and only if the program has an unique stable model.

Continuation-passing style (CPS) is a method of representing program evaluation order in a purely functional manner. Many applications of CPS rely on CPS transformations which explicitly encode evaluation strategies (e.g., call-by-name, call-by-value, etc.) into the structure of programs. Existing CPS transformations are based almost entirely on the call-by-name and call-by-value CPS transforma...

ion to deal with missing information. Consider the following three slightly different implementations of an identifier reference in the F1WAE languages. The semantics of an identifier reference can: • in case of explicit semantics, produce an error indicating that the identifier is not bound; • alternatively, also indicate that an error value is necessary by parameterizing its semantics with a ...