797 search results - page 92 / 160 » Eliminating Proofs from Programs |
LFCS
1992
Springer
14 years 2 months ago
1992
Springer
We describe a logic for reasoning about higher-order strictness properties of typed lambda terms. The logic arises from axiomatising the inclusion order on certain closed subsets ...
CIE
2006
Springer
14 years 1 months ago
2006
Springer
This note reexamines Spector's remarkable computational interpretation of full classical analysis. Spector's interpretation makes use of a rather abstruse recursion schem...
ACTAC
2002
13 years 9 months ago
2002
This paper describes a framework for handling bound variable renaming and substitution mathematically rigorously with the aim at the same time to stay as close as possible to huma...
ANOR
2002
13 years 9 months ago
2002
Abstract. The generic hoist scheduling problem is NP-hard and arises from automated manufacturing lines. In recent work using the constraint logic programming (CLP) formalism, a un...
ECCC
2002
13 years 9 months ago
2002
We shall give simpler proofs of some lower bounds on monotone computations. We describe a simple condition on combinatorial structures, such that the rank of the matrix associated...