Abstract: We introduce the notion of ∧- and ∨-pairs of functions on lattices as an abstraction of the notions of metric and its related entropy for probability distributions. T...
This paper considers compositions of conditional term rewriting systems as a basis for a modular approach to the design and analysis of equational logic programs. In this context,...
Abstract. We present the first efficient statistical zero-knowledge protocols to prove statements such as: – A committed number is a prime. – A committed (or revealed) number ...
It is advocated here that integrating abstraction and modularity into the concept of point of view, and extending the view concept to the process itself (and not only to data used ...
Higher-order typed languages, such as ML, provide strong support for data and type abn. While such abstraction is often viewed as costing performance, there are situations where i...