3381 search results - page 463 / 677 » Extending Dependencies with Conditions |
184
click to vote
IFL
1997
Springer
15 years 11 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...
160
click to vote
WIA
1997
Springer
15 years 11 months ago
1997
Springer
Abstract. We explore the information processing capabilities and efciency of DNA computations by giving two di erent types of implementations of nite-state machines. A ligation-bas...
217
click to vote
ICCAD
1994
IEEE
15 years 11 months ago
1994
IEEE
We examine the implications of a new hazard-free combinational logic synthesis method [8], which generates multiplexor trees from binary decision diagrams (BDDs) -- representation...
208
click to vote
DBPL
1993
Springer
15 years 11 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...
148
click to vote
LICS
1990
IEEE
15 years 11 months ago
1990
IEEE
In the paper "Extensional PERs" by P. Freyd, P. Mulry, G. Rosolini and D. Scott, a category C of "pointed complete extensional PERs" and computable maps is int...