We present an approach to support partiality in type-level computation without compromising expressiveness or type safety. Existing frameworks for type-level computation either require totality or implicitly assume it. For example, type families in Haskell provide a powerful, modular means of de€ning type-level computation. However, their current design implicitly assumes that type families are...

Given a non empty set S of vertices of a graph, the partiality of a vertex with respect to S is the difference between maximum and minimum of the distances of the vertex to the vertices of S. The vertices with minimum partiality constitute the fair center of the set. Any vertex set which is the fair center of some set of vertices is called a fair set. In this paper we prove that the induced sub...

The interface specification of a procedure describes the procedure’s behaviour using preand postconditions. These preand postconditions are written using various functions. If some of these functions are partial, or underspecified, then the procedure specification may not be well-defined. We show how to write preand postcondition specifications that avoid such problems, by having the preconditi...

We define the concept of partiality to cope with partial availability of arguments and results of program steps. To this end, relation algebras are investigated for which, in addition to the identity , a specific type of an ordering E ⊇ is given in order to model increasing degrees of availability. It turns out that functions regulating non-strict transfer of partialities in processes are latti...

Donna Haraway’s (1991) concept of partial or situated knowledges has been a major influence on feminist methodological debates within geography. In this paper, I argue that geographers can interrogate the partiality of knowledge by developing research designs that incorporate methods derived from different epistemological traditions. The silences and gaps between data sets can be explored to in...

We present an approach to support partiality in type-level computation without compromising expressiveness or type safety. Existing frameworks for type-level computation either require totality or implicitly assume it. For example, type families in Haskell provide a powerful, modular means of de€ning type-level computation. However, their current design implicitly assumes that type families are...

This Essay begins by identiying the various kinds of partiality the Justices of the Supreme Court can have in the cases they decide. Although there is widespread recognition of the influence these biases might have, for the most part the Justices continue to write opinions as if they (and other judges) were entirely disinterested. This practice is often thought to be justified as a source ofjud...

There are two service selection strategies in dynamic service composition, i.e., global strategy and local strategy. The existed global service selection algorithms, due to insufficiently show users’ partiality and feature of the service, is unfavorable to encourage the service provider to optimize the service quality to some extent. In this paper, an ordinary utility function is used as a nume...