Sciweavers

2370 search results - page 183 / 474
» On the Revival of Dynamic Languages
Sort
View
JFP
2008
72views more  JFP 2008»
15 years 6 months ago
Dynamic rebinding for marshalling and update, via redex-time and destruct-time reduction
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...
Peter Sewell, Gareth Stoyle, Michael Hicks, Gavin ...
ICS
2007
Tsinghua U.
16 years 12 days ago
Performance driven data cache prefetching in a dynamic software optimization system
Software or hardware data cache prefetching is an efficient way to hide cache miss latency. However effectiveness of the issued prefetches have to be monitored in order to maximi...
Jean Christophe Beyler, Philippe Clauss
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
16 years 6 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
PASTE
2010
ACM
15 years 10 months ago
The RoadRunner dynamic analysis framework for concurrent programs
ROADRUNNER is a dynamic analysis framework designed to facilitate rapid prototyping and experimentation with dynamic analyses for concurrent Java programs. It provides a clean API...
Cormac Flanagan, Stephen N. Freund
PEPM
2007
ACM
16 years 11 days ago
Lowering: a static optimization technique for transparent functional reactivity
Functional Reactive Programming (frp) extends traditional functional programming with dataflow evaluation, making it possible to write interactive programs in a declarative style...
Kimberley Burchett, Gregory H. Cooper, Shriram Kri...