4666 search results - page 219 / 934 » Equations on Timed Languages |
173
click to vote
POPL
1999
ACM
15 years 11 months ago
1999
ACM
Linking is a low-level task that is usually vaguely specified, if at all, by language definitions. However, the security of web browsers and other extensible systems depends cru...
175
click to vote
ICMCS
1999
IEEE
15 years 11 months ago
1999
IEEE
The START system responds to natural language queries with answers in text, pictures, and other media. START's sentence-level natural language parsing relies on a number of m...
186
click to vote
POPL
1998
ACM
15 years 11 months ago
1998
ACM
Previously, we developed a type system to ensure secure information flow in a sequential, imperative programming language [VSI96]. Program variables are classified as either hig...
164
click to vote
IFL
1997
Springer
15 years 10 months ago
1997
Springer
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
176
click to vote
ACL
1993
15 years 8 months ago
1993
There is a need to develop a suitable computational grammar formalism for free word order languages for two reasons: First, a suitably designed formalism is likely to be more effi...