Sciweavers

899 search results - page 93 / 180
» Implementing declarative overlays
Sort
View
SPLC
2008
13 years 9 months ago
Feature Descriptions for Context-oriented Programming
In Context-oriented Programming (COP), programs can be partitioned into behavioral variations expressed as sets of partial program definitions. Such layers can be activated and de...
Pascal Costanza, Theo D'Hondt
DLOG
1997
13 years 9 months ago
Experiments with the DFL Hybrid System
Abstract. In this short paper we describe the DFL hybrid knowledge base, that integrates descriptions with expressive object-oriented rules. The knowledge base manages a database o...
Mira Balaban, Adi Eyal
DATESO
2009
101views Database» more  DATESO 2009»
13 years 5 months ago
Using Top Trees For Easy Programming of Tree Algorithms
Top trees are a dynamic self-adjusting data structure that can be used by any tree algorithm. Actually, an arbitrary number of different tree algorithms can use a single structure....
Michal Vajbar
PADL
2011
Springer
12 years 10 months ago
Plato: A Compiler for Interactive Web Forms
Abstract. Modern web forms interact with the user in real-time by detecting errors and filling-in implied values, which in terms of automated reasoning amounts to SAT solving and ...
Timothy L. Hinrichs
ICDE
2004
IEEE
137views Database» more  ICDE 2004»
14 years 9 months ago
Selectivity Estimation for XML Twigs
Twig queries represent the building blocks of declarative query languages over XML data. A twig query describes a complex traversal of the document graph and generates a set of el...
Neoklis Polyzotis, Minos N. Garofalakis, Yannis E....