2436 search results - page 375 / 488 » Comonadic Notions of Computation |
151
click to vote
TYPES
1998
Springer
15 years 8 months ago
1998
Springer
We define a generic notion of cut that applies to many first-order theories. We prove a generic cut elimination theorem showing that the cut elimination property holds for all theo...
129
click to vote
VLDB
1998
ACM
15 years 8 months ago
1998
ACM
An information retrieval IR engine can rank documents based on textual proximityof keywords within each document. In this paper we apply this notion to search across an entire dat...
142
click to vote
COMPGEOM
1997
ACM
15 years 8 months ago
1997
ACM
Abstract. In the context of methodologies intended to confer robustness to geometric algorithms, we elaborate on the exact-computation paradigm and formalize the notion of degree o...
124
click to vote
ICALP
1997
Springer
15 years 8 months ago
1997
Springer
Despite the major role that modularity occupies in computer science, all the known results on modular analysis only treat particular problems, and there is no general unifying the...
131
click to vote
ICLP
1997
Springer
15 years 8 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...