215 search results - page 20 / 43 » Verifying haskell programs using constructive type theory |
PPDP
2009
Springer
14 years 1 months ago
2009
Springer
We present direct proofs of termination of evaluation for typed delimited-control operators shift and reset using a variant of Tait’s method with context-based reducibility pred...
ICFP
2004
ACM
14 years 9 months ago
2004
ACM
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...
POPL
2010
ACM
14 years 6 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
FPCA
1995
14 years 16 days ago
1995
Fold and unfold are general purpose functionals for processing and constructing lists. By using the categorical approach of modelling recursive datatypes as fixed points of funct...
PLDI
2012
ACM
11 years 11 months ago
2012
ACM
Generic programming (GP) is an increasingly important trend in programming languages. Well-known GP mechanisms, such as type classes and the C++0x concepts proposal, usually combi...