2777 search results - page 200 / 556 » Example centric programming |
217
Voted
ICLP
2009
Springer
16 years 1 months ago
2009
Springer
We address how to write programs for distributed computing systems in which the network topology can change dynamically. Examples of such systems, which we call ensembles, include ...
197
Voted
POPL
2008
ACM
16 years 1 months ago
2008
ACM
The search for proof and the search for counterexamples (bugs) are complementary activities that need to be pursued concurrently in order to maximize the practical success rate of...
88
Voted
ICFP
2008
ACM
16 years 23 days ago
2008
ACM
XML transformations are very sensitive to types: XML types describe the tags and attributes of XML elements as well as the number, kind, and order of their sub-elements. Therefore,...
100
click to vote
ICFP
2002
ACM
16 years 23 days ago
2002
ACM
We present the type theory LTT, intended to form a basis for typed target languages, providing an internal notion of logical proposition and proof. The inclusion of explicit proof...
100
click to vote
PEPM
2010
ACM
15 years 9 months ago
2010
ACM
Duplicated code is a well known problem in software maintenance and refactoring. Code clones tend to increase program size and several studies have shown that duplicated code make...