Abstract. We introduce the notion of regular cost functions: a quantitative extension to the standard theory of regular languages. We provide equivalent characterisations of this n...
We show that to every recursive total continuous functional there is a representative of in the hierearchy of partial continuous functionals such that is S1 - S9 computable ov...
Abstract Neil Ghani Valeria de Paiva Eike Ritter The -calculus 1 adds explicit substitutions to the -calculus so as to provide a theoretical framework within which the implement...
What will a definitive programming language look like? By definitive language I mean a programming language that gives good soat its level of abstraction, allowing computer science...
We show that a natural online algorithm for scheduling jobs on a heterogeneous multiprocessor, with arbitrary power functions, is scalable for the objective function of weighted ï¬...