: We define and compare several probabilistic notions of computability for mappings from represented spaces (that are equipped with a measure or outer measure) into computable metr...
We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-order objects. The explicit treatment of strategies allows us to specify properti...
Krishnendu Chatterjee, Thomas A. Henzinger, Nir Pi...
Following the paradigm of encapsulation of side effects via monads, the Java execution mechanism has been described by the socalled Java monad, encorporating essentially stateful ...
Abstract. Morphisms constitute a general tool for modelling complex relationships between mathematical objects in a disciplined fashion. In Formal Concept Analysis (FCA), morphisms...
Carrying out experiments in Information Retrieval is a heavy activity requiring fast tools to treat collections of significant size, and at the same time flexible tools to leave...