We propose an algorithm for generating a Priority Rewrite System (PRS) for an arbitrary process language in the OSOS format such that rewriting of process terms is sound for bisimulation and head normalising. The algorithm is inspired by a procedure which was developed by Aceto, Bloom and Vaandrager and presented in Turning SOS rules into equations [2]. For a subclass of OSOS process languages ...

We consider semantics for the class-based object-oriented calculus Featherweight Java (without casts) based uponapproximation. We also define an intersection type assignment system for this calculus and show that it satisfies subjectreduction and expansion, i.e. types are preserved under reduction and its converse. We establish a link between typeassignment and the approximation sem...

We present new methodology for drawing samples from a posterior distribution when (i) the likelihood function or (ii) a part of the prior distribution is only specified up to a normalising constant. In the case (i), the novelty lies in the introduction of an auxiliary variable in a Metropolis-Hastings algorithm and the choice of proposal distribution so that the algorithm does not depend upon t...

We aim to tackle the problem of spelling variations in a corpus of personal Portugese letters from the 16th to the 20th century. We investigated the extent to which the task of normalising Portuguese spelling can be accomplished automatically. We adapted VARD2 (Baron and Rayson, 2008), a statistical tool for normalising spelling, for use with the Portuguese language and studied its performance ...

Recent research has shown that long documents are unfairly penalised by a number of current retrieval methods. In this paper, we formally analyse two important but distinct reasons for normalising documents with respect to length, namely verbosity and scope, and discuss the practical implications of not normalising accordingly. We review a number of language modelling approaches and a range of ...

Traditionally, decidability of conversion for typed λ-calculi is established by showing that small-step reduction is confluent and strongly normalising. Here we investigate an alternative approach employing a recursively defined normalisation function which we show to be terminating and which reflects and preserves conversion. We apply our approach to the simply-typed λ-calculus with explicit s...

Explicit substitutions were proposed by Abadi, Cardelli, Curien, Hardin and LLvy to internalise substitutions into-calculus and to propose a mechanism for computing on substitutions. is another view of the same concept which aims to explain the process of substitution and to decompose it in small steps. It favours simplicity and preservation of strong normalisation. This way, another important ...

The winner-take-all (WTA) circuit is a useful computational circuit for signal processing and learning tasks. By adding spatial coupling between pixels, local regions of competition can be delineated. Recently, we described a normalising circuit which enhances Lazzaro’s WTA circuit (1989) only with the addition of a transistor and a global bias to each pixel. This new circuit allows the network...

Explicit substitutions were proposed by Abadi, Cardelli, Curien, Hardin and Lvy to internalise substitutions into λ-calculus and to propose a mechanism for computing on substitutions. λυ is another view of the same concept which aims to explain the process of substitution and to decompose it in small steps. It favours simplicity and preservation of strong normalisation. This way, another import...