Sciweavers

6597 search results - page 65 / 1320
» Orderings and Types in Databases
Sort
View
CIE
2009
Springer
14 years 3 months ago
First-Order Universality for Real Programs
J. Raymundo Marcial–Romero and M. H. Escard´o described onal programming language with an abstract data type Real for the real numbers and a non-deterministic operator rtest: Re...
Thomas Anberrée
FSEN
2009
Springer
14 years 3 months ago
Termination in Higher-Order Concurrent Calculi
Abstract. We study termination of programs in concurrent higherorder languages. A higher-order concurrent calculus combines features of the λ-calculus and of the message-passing c...
Romain Demangeon, Daniel Hirschkoff, Davide Sangio...
LICS
2012
IEEE
11 years 11 months ago
Foundational, Compositional (Co)datatypes for Higher-Order Logic: Category Theory Applied to Theorem Proving
—Interactive theorem provers based on higher-order logic (HOL) traditionally follow the definitional approach, reducing high-level specifications to logical primitives. This al...
Dmitriy Traytel, Andrei Popescu, Jasmin Christian ...
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
14 years 9 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
RSEISP
2007
Springer
14 years 3 months ago
Interpreting Low and High Order Rules: A Granular Computing Approach
The main objective of this paper is to provide a granular computing based interpretation of rules representing two levels of knowledge. This is done by adopting and adapting the de...
Yiyu Yao, Bing Zhou, Yaohua Chen