365 search results - page 60 / 73 » Using Types as Approximations for Type Checking Prolog Progr... |
SIGMOD
1998
ACM
13 years 11 months ago
1998
ACM
Semistructured data is characterized by the lack of any fixed and rigid schema, although typically the data hassomeimplicitstructure. While thelack offixedschemamakesextracting ...
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
We introduce Pulse, a framework for processing continuous queries over models of continuous-time data, which can compactly and accurately represent many real-world activities and p...
PLDI
2006
ACM
14 years 1 months ago
2006
ACM
One common technique for preventing data races in multi-threaded programs is to ensure that all accesses to shared locations are consistently protected by a lock. We present a too...
PPDP
2007
Springer
14 years 1 months ago
2007
Springer
The problem of mechanically formalizing and proving metatheoretic properties of programming language calculi, type systems, operational semantics, and related formal systems has r...
ICFP
2004
ACM
14 years 7 months ago
2004
ACM
Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive higher-...