Sciweavers

5090 search results - page 852 / 1018
» Constructing Strategies for Programming
Sort
View
ICFP
2008
ACM
16 years 6 months ago
Efficient nondestructive equality checking for trees and graphs
The Revised6 Report on Scheme requires its generic equivalence predicate, equal?, to terminate even on cyclic inputs. While the terminating equal? can be implemented via a DFA-equ...
Michael D. Adams, R. Kent Dybvig
ICFP
2006
ACM
16 years 6 months ago
Delimited dynamic binding
Dynamic binding and delimited control are useful together in many settings, including Web applications, database cursors, and mobile code. We examine this pair of language feature...
Oleg Kiselyov, Chung-chieh Shan, Amr Sabry
EUROSYS
2006
ACM
16 years 3 months ago
A quantitative analysis of aspects in the eCos kernel
Nearly ten years after its first presentation and five years after its first application to operating systems, the suitability of AspectOriented Programming (AOP) for the devel...
Daniel Lohmann, Fabian Scheler, Reinhard Tartler, ...
PEPM
2009
ACM
16 years 3 months ago
Self-adjusting computation: (an overview)
Many applications need to respond to incremental modifications to data. Being incremental, such modification often require incremental modifications to the output, making it po...
Umut A. Acar
POPL
2010
ACM
16 years 1 months ago
Lightweight asynchrony using parasitic threads
Message-passing is an attractive thread coordination mechanism because it cleanly delineates points in an execution when threads communicate, and unifies synchronization and comm...
K. C. Sivaramakrishnan, Lukasz Ziarek, Raghavendra...