2944 search results - page 309 / 589 » On Well Quasi-orders on Languages |
146
click to vote
FSTTCS
2004
Springer
16 years 2 days ago
2004
Springer
We consider hypotheses about nondeterministic computation that have been studied in different contexts and shown to have interesting consequences: • The measure hypothesis: NP d...
157
click to vote
INLG
2004
Springer
16 years 1 days ago
2004
Springer
Past work of generating referring expressions mainly utilized attributes of objects and binary relations between objects to distinguish the referent from other objects. However, su...
182
click to vote
PEPM
2004
ACM
16 years 1 days ago
2004
ACM
Advanced typing, matching, and evaluation strategy features, as well as very general conditional rules, are routinely used in equational programming languages such as, for example...
172
click to vote
LICS
2003
IEEE
15 years 12 months ago
2003
IEEE
We show that the first-order theory of structural subtyping of non-recursive types is decidable, as a consequence of a more general result on the decidability of term powers of d...
212
click to vote
RTCSA
2003
IEEE
15 years 12 months ago
2003
IEEE
Despite Java’s initial promise of providing a reliable and cost-effective platform-independent environment, the language appears to be unfavourable in the area of high-integrity...