3378 search results - page 191 / 676 » A universe of binding and computation |
142
click to vote
BIRTHDAY
2009
Springer
16 years 1 months ago
2009
Springer
Lappin and Francez (1994) present a theory of donkey anaphora which, they claim, captures both their existential and their universal readings, while maintaining a uniform represent...
165
click to vote
ACSC
2007
IEEE
16 years 28 days ago
2007
IEEE
Full hierarchical dependencies (FHDs) constitute a large class of relational dependencies. A relation exhibits an FHD precisely when it can be decomposed into at least two of its ...
162
click to vote
ISESE
2003
IEEE
15 years 12 months ago
2003
IEEE
Pair programming is a practice in which two programmers work collaboratively at one computer on the same design, algorithm, code, or test. Pair programming is becoming increasingl...
168
click to vote
CF
2008
ACM
15 years 8 months ago
2008
ACM
Using a new exact synthesizer that automatically induces minimal universal boolean function libraries, we introduce two indicators for comparing their expressiveness: the first ba...
177
click to vote
CONCUR
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We propose a model of distributed timed systems where each component is a timed automaton with a set of local clocks that evolve at a rate independent of the clocks of th...