39 search results - page 4 / 8 » Using Modes to Ensure Subject Reduction for Typed Logic Prog... |
HASKELL
2008
ACM
13 years 7 months ago
2008
ACM
We present Haskell libraries that statically ensure the safe use of resources such as file handles. We statically prevent accessing an already closed handle or forgetting to clos...
ICFP
2008
ACM
14 years 6 months ago
2008
ACM
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
ICLP
2011
Springer
12 years 9 months ago
2011
Springer
Parallel implementations of programming languages need to control synchronization overheads. Synchronization is essential for ensuring the correctness of parallel code, yet it add...
PPDP
2009
Springer
13 years 10 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
2002
ACM
14 years 6 months ago
2002
ACM
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...