3136 search results - page 477 / 628 » Genetic programming theory |
193
click to vote
CADE
2004
Springer
16 years 6 months ago
2004
Springer
contexts such as construction of abstractions, speed may be favored over completeness, so that undecidable theories (e.g., nonlinear integer arithmetic) and those whose decision pr...
208
click to vote
SIGSOFT
2007
ACM
16 years 7 months ago
2007
ACM
We present an approach for checking code against rich specifications, based on existing work that consists of encoding the program in a relational logic and using a constraint sol...
272
click to vote
ICFP
2009
ACM
16 years 7 months ago
2009
ACM
Type abstraction and intensional type analysis are features seemingly at odds--type abstraction is intended to guarantee parametricity and representation independence, while type ...
403
click to vote
ICFP
2009
ACM
16 years 7 months ago
2009
ACM
re a popular form of abstract computation. Being more general than monads, they are more broadly applicable, and in parare a good abstraction for signal processing and dataflow co...
272
click to vote
POPL
2008
ACM
16 years 6 months ago
2008
ACM
When scripts in untyped languages grow into large programs, maintaining them becomes difficult. A lack of types in typical scripting languages means that programmers must (re)disc...