Sciweavers

4940 search results - page 395 / 988
» On the Complexity of Universal Programs
Sort
View
PPL
2008
99views more  PPL 2008»
15 years 6 months ago
A Modular Implementation of Data Structures in Bulk-Synchronous Parallel ML
A functional data-parallel language called BSML has been designed for programming Bulk-Synchronous Parallel algorithms. Many sequential algorithms do not have parallel counterpart...
Frédéric Gava
IBERAMIA
2010
Springer
15 years 4 months ago
A Computational Method for Defeasible Argumentation Based on a Recursive Warrant Semantics
In a recent paper [2] the authors have formalized a recursive semantics for warranted conclusions in a general defeasible argumentation framework based on a propositional logic. Th...
Teresa Alsinet, Ramón Béjar, Lluis G...
PEPM
2009
ACM
15 years 11 months ago
Translation and optimization for a core calculus with exceptions
A requirement of any source language is to be rich in features and concise to use by the programmers. As a drawback, it is often too complex to analyse, causing research studies t...
Cristina David, Cristian Gherghina, Wei-Ngan Chin
CHI
2005
ACM
16 years 7 months ago
Design requirements for more flexible structured editors from a study of programmers' text editing
A detailed study of Java programmers' text editing found that the full flexibility of unstructured text was not utilized for the vast majority of programmers' character-...
Andrew Jensen Ko, Htet Htet Aung, Brad A. Myers
CHI
2005
ACM
16 years 7 months ago
Vista: interactive coffee-corner display
In the contemporary information-saturated world, there is a need for an easier, faster, and more social way to keep office workers updated and better aware of surrounding activiti...
Marcin Wichary, Lucy T. Gunawan, Nele Van den Ende...