632 search results - page 27 / 127 » Proving Invariants of Functional Programs |
109
Voted
ICFP
2007
ACM
16 years 14 days ago
2007
ACM
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...
PLDI
2010
ACM
15 years 5 months ago
2010
ACM
Low-level program analysis is a fundamental problem, taking the shape of “flow analysis” in functional languages and “points-to” analysis in imperative and object-oriente...
113
Voted
JFP
2000
15 years 9 days ago
2000
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...
125
Voted
FLOPS
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We present a declarative method for diagnosing missing computed answers in CFLP(D), a generic scheme for lazy Constraint Functional-Logic Programming which can be instant...
93
Voted
POPL
1998
ACM
15 years 4 months ago
1998
ACM
Data structures with a hole, in other words data structures with an uninitialized field, are useful to write efficient programs: they enable us to construct functional data stru...