136 search results - page 12 / 28 » Proving Properties of Lazy Functional Programs with Sparkle |
162
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
133
click to vote
ICFP
2010
ACM
15 years 7 months ago
2010
ACM
We show how the binary encoding and decoding of typed data and typed programs can be understood, programmed, and verified with the help of question-answer games. The encoding of a...
154
click to vote
LISP
2002
15 years 5 months ago
2002
Program termination verification is a challenging research subject of significant practical importance. While there is already a rich body of literature on this subject, it is sti...
245
click to vote
IFM
2010
Springer
15 years 4 months ago
2010
Springer
Safe is a first-order eager functional language with facilities for programmer controlled destruction and copying of data structures. It provides also regions, i.e. disjoint parts...
263
click to vote
POPL
2009
ACM
16 years 6 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...