632 search results - page 54 / 127 » Proving Invariants of Functional Programs |
84
Voted
ICFP
2005
ACM
16 years 17 days ago
2005
ACM
We present a new approach to the old problem of adding side effects to purely functional languages. Our idea is to extend the language with "witnesses," which is based o...
191
Voted
POPL
2009
ACM
16 years 1 months ago
2009
ACM
Previous deforestation and supercompilation algorithms may introduce accidental termination when applied to call-by-value programs. This hides looping bugs from the programmer, an...
111
Voted
ICFP
2008
ACM
16 years 17 days ago
2008
ACM
Self-adjusting programs respond automatically and efficiently to input changes by tracking the dynamic data dependences of the computation and incrementally updating the output as...
94
Voted
ICALP
2000
Springer
15 years 4 months ago
2000
Springer
Today many formalisms exist for specifying complex Markov chains. In contrast, formalism for specifying the quantitative properties to analyze have remained quite primitive. In th...
91
Voted
MSCS
2008
15 years 16 days ago
2008
The idea of coercive subtyping, a theory of abbreviation for dependent type theories, is incorporated into the polymorphic type system in functional programming languages. The tra...