5090 search results - page 438 / 1018 » Constructing Strategies for Programming |
305
click to vote
POPL
2007
ACM
16 years 7 months ago
2007
ACM
We introduce lock allocation, an automatic technique that takes a multi-threaded program annotated with atomic sections (that must be executed atomically), and infers a lock assig...
319
click to vote
POPL
2004
ACM
16 years 7 months ago
2004
ACM
We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require non-t...
254
click to vote
POPL
2001
ACM
16 years 7 months ago
2001
ACM
We present a variant of Proof-Carrying Code (PCC) in which the trusted inference rules are represented as a higher-order logic program, the proof checker is replaced by a nondeter...
163
click to vote
ICFP
2006
ACM
16 years 6 months ago
2006
ACM
nt programs require high-level abstractions in order to manage complexity and enable compositional reasoning. In this paper, we introduce a novel concurrency abstraction, dubbed t...
165
click to vote
ICFP
2006
ACM
16 years 6 months ago
2006
ACM
Generic Haskell is a language extension of Haskell for polytypic programming. Constrained types are parametric algebraic types with at least one argument constrained by type-class...