1679 search results - page 87 / 336 » Strong order equivalence |
144
click to vote
PPDP
2005
Springer
15 years 11 months ago
2005
Springer
We study contexts (terms with holes) by proposing a ‘λcalculus with holes’. It is very expressive and can encode programming constructs apparently unrelated to contexts, incl...
171
click to vote
TLCA
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We present a theory of proof denotations in classical propologic. The abstract definition is in terms of a semiring of weights, and two concrete instances are explored. ...
114
click to vote
SOFSEM
2004
Springer
15 years 11 months ago
2004
Springer
We initiate a systematic study of the Row Deletion(B) problem on matrices: For a fixed “forbidden submatrix” B, the question is, given an input matrix A (both A and B have ent...
181
click to vote
COCO
2001
Springer
15 years 10 months ago
2001
Springer
The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPRpairs). Some lower boun...
134
click to vote
LICS
1996
IEEE
15 years 9 months ago
1996
IEEE
We introduce the notion of higher dimensional transition systems as a model of concurrency providing an elementary, set-theoretic formalisation of the idea of higher dimensional t...