5090 search results - page 249 / 1018 » Constructing Strategies for Programming |
117
click to vote
MFCS
2007
Springer
15 years 10 months ago
2007
Springer
In computability theory, program self-reference is formalized by the not-necessarily-constructive form of Kleene’s Recursion Theorem (krt). In a programming system in which krt h...
132
click to vote
ICALT
2003
IEEE
15 years 9 months ago
2003
IEEE
In this paper, we propose a framework for the design of learning activities, which follows the key idea of the “Learning-for-Use” model and adopts characteristics from the exp...
138
click to vote
ISIPTA
2003
IEEE
15 years 9 months ago
2003
IEEE
We generalise the optimisation technique of dynamic programming for discretetime systems with an uncertain gain function. We assume that uncertainty about the gain function is des...
146
click to vote
IPPS
2000
IEEE
15 years 9 months ago
2000
IEEE
Cellular automata can be used to design high-performance natural solvers on parallel computers. This paper describes the development of applications using CARPET, a high-level prog...
135
click to vote
KBSE
1997
IEEE
15 years 8 months ago
1997
IEEE
Proofs in the Nuprl system, an implementation of a constructive type theory, yield “correct-by-construction” programs. In this paper a new methodology is presented for extract...