1670 search results - page 306 / 334 » On Skolemization in constructive theories |
ICFP
2005
ACM
15 years 9 months ago
2005
ACM
Implementing first-class continuations can pose a challenge if the target machine makes no provisions for accessing and re-installing the run-time stack. In this paper, we present...
111
click to vote
ICFP
2004
ACM
15 years 9 months ago
2004
ACM
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...
ICFP
2004
ACM
15 years 9 months ago
2004
ACM
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...
ICFP
2003
ACM
15 years 9 months ago
2003
ACM
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...
ICDE
2010
IEEE
15 years 9 months ago
2010
IEEE
In today's Internet applications or sensor networks we often encounter large amounts of data spread over many physically distributed nodes. The sheer volume of the data and ba...