Sciweavers

1000 search results - page 166 / 200
» An RDF Query Language based on Logic Programming
Sort
View
SAC
2006
ACM
15 years 3 months ago
Provably faithful evaluation of polynomials
We provide sufficient conditions that formally guarantee that the floating-point computation of a polynomial evaluation is faithful. To this end, we develop a formalization of ï¬...
Sylvie Boldo, César Muñoz
105
Voted
DOOD
1991
Springer
107views Database» more  DOOD 1991»
15 years 1 months ago
Non-Determinism in Deductive Databases
This paper examines the problem of adding non-deterministic constructs to a declarative database language based on Horn Clause Logic. We revise a previously proposed approach, the...
Fosca Giannotti, Dino Pedreschi, Domenico Sacc&agr...
76
Voted
APAL
2008
90views more  APAL 2008»
14 years 9 months ago
On the unity of duality
Most type systems are agnostic regarding the evaluation strategy for the underlying languages, with the value restriction for ML which is absent in Haskell as a notable exception....
Noam Zeilberger
91
Voted
WWW
2007
ACM
15 years 10 months ago
Toward expressive syndication on the web
Syndication systems on the Web have attracted vast amounts of attention in recent years. As technologies have emerged and matured, there has been a transition to more expressive s...
Christian Halaschek-Wiener, James A. Hendler
92
Voted
DLS
2008
149views Languages» more  DLS 2008»
14 years 11 months ago
Gradual typing with unification-based inference
Static and dynamic type systems have well-known strengths and weaknesses. Gradual typing provides the benefits of both in a single language by giving the programmer control over w...
Jeremy G. Siek, Manish Vachharajani