Sciweavers

1665 search results - page 179 / 333
» Design Patterns as Language Constructs
Sort
View
HASKELL
2007
ACM
15 years 10 months ago
Why it's nice to be quoted: quasiquoting for haskell
Quasiquoting allows programmers to use domain specific syntax to construct program fragments. By providing concrete syntax for complex data types, programs become easier to read, ...
Geoffrey Mainland
C3S2E
2008
ACM
15 years 7 months ago
Concurrent software engineering: preparing for paradigm shift
Software systems bridge the gap between information processing needs and available computer hardware. As system requirements grow in complexity and hardware evolves, the gap does ...
Peter Grogono, Brian Shearing
AOSD
2007
ACM
15 years 10 months ago
Open bisimulation for aspects
We define and study bisimulation for proving contextual equivalence in an aspect extension of the untyped lambda-calculus. To our knowledge, this is the first study of coinductive...
Radha Jagadeesan, Corin Pitcher, James Riely
SAS
1999
Springer
15 years 10 months ago
Eliminating Dead Code on Recursive Data
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...
Yanhong A. Liu, Scott D. Stoller
ASPLOS
2006
ACM
16 years 8 days ago
Type inference for unboxed types and first class mutability
Systems programs rely on fine-grain control of data representation and use of state to achieve performance, conformance to hardware specification, and temporal predictability. T...
Swaroop Sridhar, Jonathan S. Shapiro