8636 search results - page 1325 / 1728 » How Developers Copy |
187
click to vote
DBPL
1993
Springer
15 years 10 months ago
1993
Springer
A frequent dilemma in the design of a database programming language is the choice between a language with a rich set of tailored notations for schema definitions, query expression...
202
click to vote
DAC
1994
ACM
15 years 10 months ago
1994
ACM
We provide a new theoretical framework for constructing Steiner routing trees with minimum Elmore delay. Earlier work [3, 13] has established Elmore delay as a high delity estima...
191
click to vote
CONCUR
1992
Springer
15 years 10 months ago
1992
Springer
The states of a computing system bear information and change time, while its events bear time and change information. We develop a primitive algebraic model of this duality of tim...
206
click to vote
PEPM
1993
ACM
15 years 10 months ago
1993
ACM
The aim of binding-time analysis is to determine when variables, expressions, statements, etc. in a program can be evaluated by classifying these into static (compile-time) and dy...
180
click to vote
TACS
1994
Springer
15 years 10 months ago
1994
Springer
The ML type system was originally introduced as a means of identifying a class of terms in a simple untyped language, often referred to as core-ML, whose evaluation could be guaran...