2477 search results - page 403 / 496 » Parallelizing Functional Programs by Generalization |
162
click to vote
TLDI
2003
ACM
15 years 7 months ago
2003
ACM
Standard ML employs an opaque (or generative) semantics of datatypes, in which every datatype declaration produces a new type that is different from any other type, including othe...
134
click to vote
ICFP
1999
ACM
15 years 6 months ago
1999
ACM
d Abstract) Assaf J. Kfoury∗ Boston University http://www.cs.bu.edu/˜kfoury Harry G. Mairson† Brandeis University http://www.cs.brandeis.edu/˜mairson Franklyn A. Turbak‡ We...
139
Voted
BMCBI
2005
15 years 2 months ago
2005
Background: Several problems exist with current methods used to align DNA sequences for comparative sequence analysis. Most dynamic programming algorithms assume that conserved se...
133
click to vote
TOPLAS
2008
15 years 2 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
110
click to vote
CORR
2004
Springer
15 years 2 months ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...