591 search results - page 36 / 119 » Implementing Joins Using Extensible Pattern Matching |
ICWE
2007
Springer
15 years 3 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...
65
Voted
ICFP
2006
ACM
15 years 9 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...
FLOPS
2004
Springer
15 years 1 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...
PKDD
2005
Springer
15 years 3 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...
SPIRE
2005
Springer
15 years 3 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...