79 search results - page 4 / 16 » Full Abstraction and the Context Lemma |
ENTCS
2006
13 years 7 months ago
2006
It is reasonable to assume that quantum computations take place under the control of the classical world. For modelling this standard situation, we introduce a Classically-control...
SIAMREV
2010
13 years 2 months ago
2010
We examine condition numbers, preconditioners, and iterative methods for finite element discretizations of coercive PDEs in the context of the fundamental solvability result, the L...
BEHAVIOURIT
2002
13 years 7 months ago
2002
Abstract. An experiment is reported that compared expandable indexes providing full menu context with sequentialmenus providing only partial context. Menu depth was varied using hi...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
The central problem in computational mechanism design is the tension between incentive compatibility and computational ef ciency. We establish the rst significant approximability ...
TLCA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. In 1994 Herbelin started and partially achieved the programme of showing that, for intuitionistic implicational logic, there is a Curry-Howard interpretation of sequent c...