331 search results - page 35 / 67 » HOLCF: Higher Order Logic of Computable Functions |
101
Voted
CCA
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
126
click to vote
TPHOL
1999
IEEE
15 years 4 months ago
1999
IEEE
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...
SAC
2006
ACM
15 years 6 months ago
2006
ACM
In the paper we describe the problem of grouping and aggregation in the concept-oriented data model. The model is based on ordering its elements within a hierarchical multidimensi...
108
Voted
RTA
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Interaction nets are a graphical formalism inspired by Linear Logic proof-nets often used for studying higher order rewriting e.g. β-reduction. Traditional presentations...
126
Voted
CIKM
2000
Springer
15 years 4 months ago
2000
Springer
—As databases increasingly integrate different types of information such as multimedia, spatial, time-series, and scientific data, it becomes necessary to support efficient retri...