784 search results - page 126 / 157 » Relaxing the Value Restriction |
ICALP
2000
Springer
14 years 18 days ago
2000
Springer
Abstract. We describe SAFL, a call-by-value first-order functional language which is syntactically restricted so that storage may be statically allocated to fixed locations. Evalua...
COCO
1991
Springer
14 years 16 days ago
1991
Springer
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
TAPSOFT
1991
Springer
14 years 16 days ago
1991
Springer
Abstract. CBS is a simple and natural CCS-like calculus where processes speak one at a time and are heard instantaneously by all others. Speech is autonomous, contention between sp...
AAAI
2007
13 years 11 months ago
2007
In auction theory, agents are typically presumed to have perfect knowledge of their valuations. In practice, though, they may face barriers to this knowledge due to transaction co...
AAAI
2008
13 years 11 months ago
2008
Modal logic represents knowledge that agents have about other agents' knowledge. Probabilistic modal logic further captures probabilistic beliefs about probabilistic beliefs....