Sciweavers

161 search results - page 6 / 33
» Lazy call-by-value evaluation
Sort
View
PEPM
2010
ACM
14 years 4 months ago
Making "stricterness" more relevant
Adapting a strictness analyser to have it take into account explicit strictness annotations can be a tricky business. Straightforward extensions of analyses based on relevance typ...
Stefan Holdermans, Jurriaan Hage
POPL
2007
ACM
14 years 8 months ago
Lazy multivariate higher-order forward-mode AD
A method is presented for computing all higher-order partial derivatives of a multivariate function Rn R. This method works by evaluating the function under a nonstandard interpre...
Barak A. Pearlmutter, Jeffrey Mark Siskind
ISCA
1993
IEEE
117views Hardware» more  ISCA 1993»
13 years 11 months ago
Evaluation of Release Consistent Software Distributed Shared Memory on Emerging Network Technology
We evaluate the e ect of processor speed, network bandwidth, and software overhead on the performance of release-consistent software distributed shared memory. We examine ve di er...
Sandhya Dwarkadas, Peter J. Keleher, Alan L. Cox, ...
WIDM
2006
ACM
14 years 1 months ago
Lazy preservation: reconstructing websites by crawling the crawlers
Backup of websites is often not considered until after a catastrophic event has occurred to either the website or its webmaster. We introduce “lazy preservation” – digital p...
Frank McCown, Joan A. Smith, Michael L. Nelson
SOCO
2009
Springer
14 years 2 months ago
Lazy Composition of Representations in Java
Abstract. The separation of concerns has been a core idiom of software engineering for decades. In general, software can be decomposed properly only according to a single concern, ...
Rémi Douence, Xavier Lorca, Nicolas Loriant