19003 search results - page 302 / 3801 » We Need Assurance |
164
click to vote
ISSE
2006
15 years 6 months ago
2006
Can Design Patterns be turned into reusable components? To help answer this question, we have performed a systematic study of the standard design patterns. One of the most ing is ...
179
click to vote
ENTCS
2007
15 years 6 months ago
2007
We analyze the matching problem for bigraphs. In particular, we present a sound and complete inductive characterization of matching of binding bigraphs. Our results pave the way f...
193
click to vote
SIGPLAN
2008
15 years 6 months ago
2008
While the programming languages course played a key role in Curricula '68, '78, and '91, Curriculum 2001 replaced most of the content in programming languages with ...
163
click to vote
COMBINATORICS
2002
15 years 6 months ago
2002
If we compose sufficiently many random functions on a finite set, then the composite function will be constant. We determine the number of compositions that are needed, on average...
155
click to vote
ENTCS
2000
15 years 6 months ago
2000
We describe how to embed a simple typed functional logic programming language in Haskell. The embedding is a natural extension of the Prolog embedding by Seres and Spivey [16]. To...