17983 search results - page 19 / 3597 » Set Types and Applications |
117
click to vote
DBPL
1999
Springer
15 years 6 months ago
1999
Springer
Semistructured databases are treated as dynamically typed: they come equipped with no independent schema or type system to constrain the data. Query languages that are designed fo...
103
click to vote
DAC
1995
ACM
15 years 6 months ago
1995
ACM
—In this paper, we present an algorithm for finding a good Ashenhurst decomposition of a switching function. Most current methods for performing this type of decomposition are ba...
107
Voted
MIE
2008
15 years 3 months ago
2008
Many attempts have been made in the QA domain but no system applicable to the field of health is currently available on the Internet. This paper describes a bilingual French/Engli...
126
click to vote
CSFW
2007
IEEE
15 years 8 months ago
2007
IEEE
mplementations for Typed Session Abstractions Ricardo Corin1,2,3 Pierre-Malo Deni´elou1,2 C´edric Fournet1,2 Karthikeyan Bhargavan1,2 James Leifer1 1 MSR-INRIA Joint Centre 2 Mic...
137
Voted
CORR
2010
Springer
14 years 12 months ago
2010
Springer
Basic proof search tactics in logic and type theory can be seen as the root-rst applications of rules in an appropriate sequent calculus, preferably without the redundancies gener...