3136 search results - page 288 / 628 » Genetic programming theory |
193
click to vote
AISC
2010
Springer
15 years 9 months ago
2010
Springer
We prove formally that the first order theory of algebraically closed fields enjoy quantifier elimination, and hence is decidable. This proof is organized in two modular parts. We ...
138
click to vote
ACTA
2004
15 years 5 months ago
2004
Abstract. This paper explores theories that help in (i) proving that a system composed from components satisfies a system specification given only specifications of components and ...
154
click to vote
OOPSLA
2009
Springer
16 years 15 days ago
2009
Springer
In this paper we describe Ginger, a new language with first class support for literate programming. Literate programming refers to a philosophy that argues computer programs shou...
315
click to vote
Book
"These course notes are addressed to a wide audience of people interested in modern programming languages in general, ML-like languages in particular, or simply in OCaml, whet...
246
click to vote
POPL
2007
ACM
16 years 6 months ago
2007
ACM
Type-preserving compilation can improve software reliability by generating code that can be verified independently of the compiler. Practical type-preserving compilation does not ...