336 search results - page 21 / 68 » Program Speedups in Theory and Practice |
215
Voted
POPL
2006
ACM
16 years 3 months ago
2006
ACM
This article presents a polymorphic modal type system and its principal type inference algorithm that conservatively extend ML by all of Lisp's staging constructs (the quasi-...
160
Voted
JELIA
2010
Springer
15 years 1 months ago
2010
Springer
In previous work, the so-called Temporal Equilibrium Logic (TEL) was introduced. This formalism provides an extension of the Answer Set semantics for logic programs to arbirary the...
159
click to vote
PLDI
2011
ACM
14 years 6 months ago
2011
ACM
Current proposals for concurrent shared-memory languages, including C++ and C, provide sequential consistency only for programs without data races (the DRF guarantee). While the i...
146
Voted
POPL
2010
ACM
16 years 24 days ago
2010
ACM
This paper introduces a new approach to type theory called pure subtype systems. Pure subtype systems differ from traditional approaches to type theory (such as pure type systems)...
132
Voted
ICFEM
2010
Springer
15 years 1 months ago
2010
Springer
Despite the advancements of concurrency theory in the past decades, practical concurrent programming has remained a challenging activity. Fundamental problems such as data races an...