4835 search results - page 629 / 967 » Refactoring Functional Programs |
160
Voted
VMCAI
2010
Springer
15 years 12 months ago
2010
Springer
Abstract. Techniques such as verification condition generation, preditraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Pr...
114
Voted
CGO
2006
IEEE
15 years 8 months ago
2006
IEEE
The phase-ordering problem is a long standing issue for compiler writers. Most optimizing compilers typically have numerous different code-improving phases, many of which can be a...
98
Voted
TLDI
2005
ACM
15 years 8 months ago
2005
ACM
Coordinated data structures are sets of (perhaps unbounded) data structures where the nodes of each structure may share types with the corresponding nodes of the other structures....
126
Voted
COLT
1999
Springer
15 years 7 months ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
106
click to vote
DEXA
1999
Springer
15 years 7 months ago
1999
Springer
: In an extensible database system, evaluation of a query plan is done in cooperation between a collection of operator implementation functions and a component of the DBMS that we ...