365 search results - page 5 / 73 » Using Types as Approximations for Type Checking Prolog Progr... |
ICDT
2005
ACM
14 years 1 months ago
2005
ACM
Abstract. We survey work on statically type checking XML transformations, covering a wide range of notations and ambitions. The concept of type may vary from idealizations of DTD t...
KBSE
2005
IEEE
14 years 1 months ago
2005
IEEE
Concurrent programs are notorious for containing errors that are difficult to reproduce and diagnose. Two common kinds of concurrency errors are data races and atomicity violation...
ICFP
2004
ACM
14 years 7 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...
KBSE
2008
IEEE
14 years 1 months ago
2008
IEEE
—A software product line (SPL) is an efficient means to generate a family of program variants for a domain from a single code base. However, because of the potentially high numb...
IFL
2001
Springer
13 years 12 months ago
2001
Springer
The parallel-functional language Eden extends Haskell with constructs to explicitly define and communicate processes. These extensions allow the easy definition of skeletons as h...