In this paper we present a novel approach to model the search space for optimal set data types in network component realisations. The main objective is to arrive at power efficie...
The rewriting calculus is a rule construction and application framework. As such it embeds in a uniform way term rewriting and lambda-calculus. Since rule application is an explic...
We study the problem of scheduling unit time tasks of two types on m parallel identical machines. For each type, given numbers of tasks are required to be completed by the specifi...
An extension of the simply-typed lambda calculus is presented which contains both well-structured inductive and coinductive types, and which also identifies a class of types for w...
Abstract. Increasing attention is being paid to the development of socalled behavioural types as a means to formally address the problem of ensuring the correct interoperation of s...