552 search results - page 30 / 111 » Languages Modulo Normalization |
218
Voted
ICIW
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper, we present an extension of PHIL, a declarative language for filtering information from XML data. The proposed approach allows us to extract relevant data as well a...
165
Voted
EMSOFT
2007
Springer
16 years 28 days ago
2007
Springer
E-FRP is declarative language for programming resourcebounded, event-driven systems. The original high-level semantics of E-FRP requires that each event handler execute atomically...
213
Voted
RTA
2005
Springer
16 years 7 days ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
171
Voted
LISP
2008
15 years 6 months ago
2008
Abstract Reasoning about the termination of equational programs in sophisticated equational languages such as ELAN, MAUDE, OBJ, CAFEOBJ, HASKELL, and so on, requires support for ad...
188
Voted
PVLDB
2010
15 years 5 months ago
2010
Independence analysis is the problem of determining whether an update affects the result of a query, e.g. a constraint or materialized view. We develop a new, modular framework fo...