Several relation-algebraic algorithms for computing the cut completion of a partially ordered set are formally developed and afterwards generalized to the case of concept lattices....
We show that typability for a natural form of polymorphic recursive typing for rank-2 intersection types is undecidable. Our proof involves characterizing typability as a context ...
The universal Horn theory of relational Kleene algebra with tests (RKAT) is of practical interest, particularly for program semantics. We develop an (infinitary) proof system, ba...
Abstract. This paper describes Paradis-Net, a typed event-driven messagepassing interface for designing distributed systems. Paradis-Net facilitates the development of both peer-to...
A new system for real-time customer relationship management is proposed. The system is based on deploying a network of RFID readers throughout an environment. Information about the...