MLF is a type system that extends a functional language with impredicative rank-n polymorphism. Type inference remains possible and only in some clearly defined situations, a loca...
It is possible to extend the basic notion of "function call" to allow functions to have multiple return points. This turns out to be a surprisingly useful mechanism. Thi...
— This paper looks at designing circuit elements that will be constructed with nanoscale magnets within the Quantum-dot Cellular Automata (QCA) computational paradigm. In magneti...
Michael T. Niemier, Xiaobo Sharon Hu, Aaron Dingle...
In this paper we argue that “persuasive technologies,” developed to motivate behaviour change in users, have so far failed to exploit the established body of empirical researc...
Ben Kirman, Conor Linehan, Shaun Lawson, Derek Fos...
Abstract. We introduce a generalisation of monads, called relative monads, allowing for underlying functors between different categories. Examples include finite-dimensional vect...