Sciweavers

228 search results - page 12 / 46
» An effective theory of type refinements
Sort
View
CSL
2006
Springer
13 years 11 months ago
Decidable Theories of the Ordering of Natural Numbers with Unary Predicates
Abstract. Expansions of the natural number ordering by unary predicates are studied, using logics which in expressive power are located between first-order and monadic second-order...
Alexander Moshe Rabinovich, Wolfgang Thomas
ICFP
2005
ACM
14 years 7 months ago
A unified category-theoretic formulation of typed binding signatures
We generalise Fiore et al's account of variable binding for untyped cartesian contexts and Tanaka's account of variable binding for untyped linear contexts to give an ac...
Miki Tanaka, John Power
SIGMOD
2008
ACM
123views Database» more  SIGMOD 2008»
14 years 8 months ago
SchemaScope: a system for inferring and cleaning XML schemas
We present SchemaScope, a system to derive Document Type Definitions and XML Schemas from corpora of sample XML documents. Tools are provided to visualize, clean, and refine exist...
Geert Jan Bex, Frank Neven, Stijn Vansummeren
ENTCS
2008
92views more  ENTCS 2008»
13 years 8 months ago
Redundancy Elimination for LF
We present a type system extending the dependent type theory LF, whose terms are more amenable to compact representation. This is achieved by carefully omitting certain subterms w...
Jason Reed
ACMDIS
2008
ACM
13 years 10 months ago
Evaluating the effectiveness of term frequency histograms for supporting interactive web search tasks
Throughout many of the different types of Web searches people perform, the primary tasks are to first craft a query that effectively captures their information needs, and then eva...
Orland Hoeber, Xue Dong Yang