41 search results - page 6 / 9 » On the Modularity of Deciding Call-by-Need |
SSS
2009
Springer
14 years 3 months ago
2009
Springer
: The Borowsky-Gafni (BG) simulation algorithm is a powerful tool that allows a set of t + 1 asynchronous sequential processes to wait-free simulate (i.e., despite the crash of up ...
DBPL
2005
Springer
14 years 2 months ago
2005
Springer
We study peer-to-peer ðP2PÞ data integration, where each peer models an autonomous system that exports data in terms of its own schema, and data interoperation is achieved by me...
AISC
2010
Springer
13 years 12 months ago
2010
Springer
We prove formally that the first order theory of algebraically closed fields enjoy quantifier elimination, and hence is decidable. This proof is organized in two modular parts. We ...
POPL
2012
ACM
12 years 4 months ago
2012
ACM
We show how to combine a general purpose type system for an existing language with support for programming with binders and contexts by refining the type system of ML with a rest...
DEON
2010
Springer
13 years 11 months ago
2010
Springer
We provide a logical analysis of private international law, the body of law establishing when courts of a country should decide a case (jurisdiction) and what legal system they sho...