3136 search results - page 329 / 628 » Genetic programming theory |
192
click to vote
ICFP
2003
ACM
16 years 6 months ago
2003
ACM
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...
201
click to vote
POPL
2010
ACM
16 years 4 months ago
2010
ACM
We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...
168
Voted
VSTTE
2005
Springer
16 years 3 days ago
2005
Springer
How close are we to a world in which mechanically verified software is commonplace? A world in which theorem proving technology is used routinely by both software developers and p...
179
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
306
click to vote
ICFP
2009
ACM
16 years 7 months ago
2009
ACM
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...