Most applications of the abstract interpretation framework[2] have been for analyzing functional programs use functions on abstract values to approximate functions, thus assuming that functions may be called at all arguments. When the abstract domain is finite, this approach can easily be generalized to higher order functional languages as shown for example by [1]. In practice this leads to com...

We apply the categorical properties of polymorphic functions to compile-time analysis, speciically projection-based strictness analysis. First we interpret parameterised types as functors in a suitable category, and show that they preserve monics and epics. Then we deene \strong" and \weak" polymorphism, the latter admitting certain projections that are not polymorphic in the usual sense. We pr...

A direct and elementary proof of an estimate of Littlewood is given together with an application concerning the sharpness and strictness of some inclusions in mixed norm spaces of analytic functions.

We propose two analyses of the evaluation strategy (the E-strategy). Firstly, we analyze a completeness of the E-strategy. For a complete E-strategy each evaluated term is guaranteed to be a normal form. In this paper we de ne the notion of the completeness for the context-sensitive rewriting, called -completeness, and show a condition of the E-strategy to satisfy the -completeness. Secondarily...

We show that for each n and m, there is an existential first order sentence which is NOT logically equivalent to a sentence of quantifier rank at most m in infinitary logic augmented with all generalized quantifiers of arity at most n. We use this to show the strictness of the quantifier rank hierarchies for various logics ranging from existential (or universal) fragments of first order logic t...

In this paper regulated morphological operations are de"ned by extending the "tting interpretation of the ordinary morphological operations. The de"ned operations have a controllable strictness, and so they are less sensitive to noise and small intrusions or protrusions on the boundaries of shapes. The properties of the de"ned operations are described, and the relations between them and some ot...

We present a pumping lemma for each level of the collapsible pushdown graph hierarchy in analogy to the second author’s pumping lemma for higher-order pushdown graphs (without collapse). Using this lemma, we give the first known examples that separate the levels of the collapsible pushdown graph hierarchy and of the collapsible pushdown tree hierarchy, i.e., the hierarchy of trees generated by ...

Two-phase locking is a standard method for managing concurrent transactions in database systems. In order to guarantee good recovery properties, two-phase locking should be strict, meaning that locks can be released only after the transaction's commit or abort. In this paper we show that even exclusive locks can be released immediately after the commit request has arrived, without sacriicing an...