We present a sound, complete, modular and lean labelled tableau calculus for many propositional modal logics where the labels contain \free" and \universal" variables. Our \lean" Prolog implementation is not only surprisingly short, but compares favourably with other considerably more complex implementations for modal deduction.

Finding appropriate bound sets of variables is the most important task of functional decomposition. When solving some problems the bound sets need to be large; for instance in decomposition to symmetric subfunctions realized in MOPS arrays for submicron technologies, or when no good small bound sets exist. In such cases the creation of the incompatibility graph, that is necessary to evaluate go...

This paper analyses inherent clitics of idiomatic constructions as verbal arguments (Jelinek 1984, Baker 1996, Hale 2003) that are translated as free variables (Delfitto 2002): they are anaphoric to a (hidden) non-referential discourse topic or (right) dislocated constituent. Furthermore, since they denote abstract semantic objects (Asher 1993), they are assumed to be semantically incorporated ...

In a bounded analysis, arithmetic operators become partial, and a different semantics becomes necessary. One approach, mimicking programming languages, is for overflow to result in wrap-around. Although easy to implement, wrap-around produces unexpected counterexamples that do not correspond to cases that would arise in the unbounded setting. This paper describes a new approach, implemented in ...

Whole Leaves, Photosynthesis, Herbicide Penetration and Detoxification, Fluorometric M ethod The effect of herbicides that inhibit the photosynthetic electron transport at the photosystem II acceptor side has been analyzed in whole plants by using a fluorometric method. The data reported indicate that the apparent variable fluorescence o f the induction curve normalized to the control value pro...

Handling variable binding is one of the main difficulties in formal proofs. In this context, Moggi’s computational metalanguage serves as an interesting case study. It features monadic types and a commuting conversion rule that rearranges the binding structure. Lindley and Stark have given an elegant proof of strong normalization for this calculus. The key construction in their proof is a notio...

ions which did not contain assignments to their formalparameters, but the necessary changes to the predicates are ex­tensive and do not yield a wider class of computations: if I isnot covertly assigned to in L 2.5.3 establishes that E is equivalentto e[E](i\I'.I'=I~false,tpue), and thus a version of 2.5.4 confirms that fnI.E can be replaced by fnI .• E, which we allow in any cas...

We present a new class of second-order unification problems, which we have called linear. We deal with completely general second-order typed unification problems, but we restrict the set of unifiers under consideration: they instantiate free variables by linear terms, i.e. terms where any λ-abstractions bind one and only one occurrence of a bound variable. Linear second-order unification proper...

Thank you for submitting your manuscript for consideration by the EMBO Journal. First of all, please let me apologise for the length of time taken to get back to you with a decision this was due firstly to some difficulty in finding three appropriate referees, and secondly to a delay in receiving the final report. However, your manuscript has now been seen by three referees whose comments are e...

The representation of free variables is crucial for the efficiency of the implementation of various kinds of rewrite systems. We give an innovative, although very natural, representation of variables abstract enough to fit in many different frameworks and more satisfactory from an operational perspective than usual representations. This work also provides a generalisation of director strings fo...