We propose >>-lifting as a technique for extending operational predicates to Moggi’s monadic computation types, independent of the choice of monad. We demonstrate the method with an application to Girard-Tait reducibility, using this to prove strong normalisation for the computational metalanguage λml . The particular challenge with reducibility is to apply this semantic notion at computation t...

The addition of Ru to Mn and Zr-modified Co/SiO2 catalysts, while applying different preparation orders and loading amounts, was investigated as a means of enhancing the Fischer-Tropsch synthesis reaction. The coimpregnation of Zr/SiO2 with Co, Mn and Ru gave the most attractive catalytic properties. This can be attributed to the higher dispersion of Co metal resulting from the coimpregnation o...

Boundary charges in gauge theories (like the ADM mass in general relativity) can be understood as integrals of linear conserved n-2 forms of the free theory linearized around the background. These forms are associated one-to-one to reducibility parameters of this background (like the time-like Killing vector of Minkowski space-time). For such n-2 forms, a non-linear completion is constructed th...

Markov chain Monte Carlo methods are frequently used in the analyses of genetic data on pedigrees for the estimation of probabilities and likelihoods which cannot be calculated by existing exact methods. In the case of discrete data, the underlying Markov chain may be reducible and care must be taken to ensure that reliable estimates are obtained. Potential reducibility thus has implications fo...

For the natural notion of splitting classes into two disjoint subclasses via a recursive classifier working on texts, the question is addressed how these splittings can look in the case of learnable classes. Here the strength of the classes is compared using the strong and weak reducibility from intrinsic complexity. It is shown that for explanatorily learnable classes, the complete classes are...

In the context of the study of rule-based programming, we focus in this paper on the property of C-reducibility, expressing that every term reduces to a constructor term on at least one of its rewriting derivations. This property implies completeness of function definitions, and enables to stop evaluations of a program on a constructor form, even if the program is not terminating. We propose an...