Sciweavers

4743 search results - page 241 / 949
» Introduction to Functional Programming
Sort
View
POPL
2009
ACM
16 years 7 months ago
Static contract checking for Haskell
Program errors are hard to detect and are costly both to programmers who spend significant efforts in debugging, and for systems that are guarded by runtime checks. Static verific...
Dana N. Xu, Simon L. Peyton Jones, Koen Claessen
ICFP
2005
ACM
16 years 6 months ago
Witnessing side-effects
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...
Tachio Terauchi, Alexander Aiken
ESOP
2010
Springer
15 years 10 months ago
CFA2: A Context-Free Approach to Control-Flow Analysis
Abstract. In a functional language, the dominant control-flow mechanism is function call and return. Most higher-order flow analyses, including k-CFA, do not handle call and retu...
Dimitrios Vardoulakis, Olin Shivers
IWFM
1998
117views Formal Methods» more  IWFM 1998»
15 years 8 months ago
A Case Study on Proving Transformations Correct: Data-Parallel Conversion
The issue of correctness in the context of a certain style of program transformation is investigated. This style is characterised by the fully automated application of large numbe...
Stephen Kilpatrick, Maurice Clint, Peter Kilpatric...
POPL
2009
ACM
16 years 7 months ago
Positive supercompilation for a higher order call-by-value language
Previous deforestation and supercompilation algorithms may introduce accidental termination when applied to call-by-value programs. This hides looping bugs from the programmer, an...
Peter A. Jonsson, Johan Nordlander