4895 search results - page 266 / 979 » Functional Quantum Programming |
163
click to vote
SIGSOFT
2007
ACM
16 years 7 months ago
2007
ACM
Asynchronous systems components are hard to write, hard to reason about, and (not coincidentally) hard to mechanically verify. In order to achieve high performance, asynchronous c...
168
click to vote
IWPC
2005
IEEE
16 years 3 days ago
2005
IEEE
Incremental software change adds new functionality to software. It is the foundation of software evolution, maintenance, iterative development, agile development, and other softwa...
223
click to vote
CSL
2007
Springer
16 years 21 days ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ï...
144
click to vote
FSTTCS
1993
Springer
15 years 10 months ago
1993
Springer
A for-loop is somewhat similar to an inductive argument. Just as the truth of a proposition P(n + 1) depends on the truth of P(n), the correctness of iteration n+1 of a for-loop de...
184
click to vote
GECCO
2004
Springer
15 years 12 months ago
2004
Springer
In this paper we examine the effects of single node mutations on trees evolved via genetic programming. The results show that neutral mutations are less likely for nodes nearer th...