Sciweavers

1712 search results - page 148 / 343
» Abstract Constraint Data Types
Sort
View
AGP
1995
IEEE
15 years 6 months ago
Domain Independent Ask Approximation in CCP
The main difficulty in the formalization of a static analysis framework for CC programs is probably related to the correct approximation of the entailment relation between constrai...
Enea Zaffanella
OOPSLA
1995
Springer
15 years 6 months ago
Subtypes vs. Where Clauses: Constraining Parametric Polymorphism
All object-oriented languages provide support for subtype polymorphism, which allows the writing of generic code that works for families of related types. There is also a need, ho...
Mark Day, Robert Gruber, Barbara Liskov, Andrew C....
GEOS
2009
Springer
15 years 7 months ago
SPARQL Query Re-writing Using Partonomy Based Transformation Rules
Abstract. Often the information present in a spatial knowledge base is represented at a different level of granularity and abstraction than the query constraints. For querying onto...
Prateek Jain, Peter Z. Yeh, Kunal Verma, Cory A. H...
BTW
2005
Springer
107views Database» more  BTW 2005»
15 years 8 months ago
DBMS Architecture - Still an Open Problem
More than two decades ago, DB researchers faced up to the question of how to design a data-independent database management system (DBMS), that is, a DBMS which offers an appropriat...
Theo Härder
ICFP
2010
ACM
15 years 4 months ago
Regular, shape-polymorphic, parallel arrays in Haskell
We present a novel approach to regular, multi-dimensional arrays in Haskell. The main highlights of our approach are that it (1) is purely functional, (2) supports reuse through s...
Gabriele Keller, Manuel M. T. Chakravarty, Roman L...