2905 search results - page 380 / 581 » Formal Memetic Algorithms |
233
click to vote
POPL
2008
ACM
16 years 4 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
228
click to vote
POPL
2006
ACM
16 years 4 months ago
2006
ACM
This paper specifies, via a Hoare-like logic, an interprocedural and flow sensitive (but termination insensitive) information flow analysis for object-oriented programs. Pointer a...
198
click to vote
POPL
2003
ACM
16 years 4 months ago
2003
ACM
We present a framework for applying memoization selectively. The framework provides programmer control over equality, space usage, and identification of precise dependences so tha...
148
click to vote
ICFP
2008
ACM
16 years 4 months ago
2008
ACM
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
153
click to vote
ICFP
2005
ACM
16 years 4 months ago
2005
ACM
ML modules and Haskell type classes have proven to be highly effective tools for program structuring. Modules emphasize explicit configuration of program components and the use of...