591 search results - page 36 / 119 » Implementing Joins Using Extensible Pattern Matching |
125
click to vote
ICWE
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. It is more convenient to talk about changes in a domainspecific way than to formulate them at the programming construct level or—even worse—purely lexical level. Usi...
119
click to vote
ICFP
2006
ACM
16 years 4 months ago
2006
ACM
We present language mechanisms for polymorphic, extensible records and their exact dual, polymorphic sums with extensible first-class cases. These features make it possible to eas...
124
click to vote
FLOPS
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Outermost-needed rewriting/narrowing is a sound and complete optimal demand-driven strategy for the class of inductively sequential constructor systems. Its parallel exte...
142
click to vote
PKDD
2005
Springer
15 years 10 months ago
2005
Springer
For an undirected graph ¢ without self-loop, we prove: (i) that the number of closed patterns in the adjacency matrix of ¢ is even; (ii) that the number of the closed patterns i...
128
click to vote
SPIRE
2005
Springer
15 years 10 months ago
2005
Springer
We present a new algorithm for generating super condensed neighbourhoods. Super condensed neighbourhoods have recently been presented as the minimal set of words that represent a p...