Sciweavers

2004 search results - page 142 / 401
» Interaction nets: programming language design and implementa...
Sort
View
IPPS
2009
IEEE
16 years 1 months ago
Scalable RDMA performance in PGAS languages
Partitioned Global Address Space (PGAS) languages provide a unique programming model that can span shared-memory multiprocessor (SMP) architectures, distributed memory machines, o...
Montse Farreras, George Almási, Calin Casca...
PLDI
2004
ACM
15 years 11 months ago
The set constraint/CFL reachability connection in practice
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
John Kodumal, Alexander Aiken
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
VL
1995
IEEE
15 years 10 months ago
Display-Based Problems in Spreadsheets: A Critical Incident and a Design Remedy
A critical incident is reported where a discretionary user needed to partition the spreadsheet grid into an arithmetic series of blocks and apply a function to each, but was unabl...
David G. Hendry
WCRE
2006
IEEE
16 years 11 days ago
An Analysis of the Correctness and Completeness of Aspect Weaving
Jointly deployed aspects may interact with each other. While some interactions might be intended, unintended interactions (interferences) can break a program. Detecting and resolv...
Günter Kniesel, Uwe Bardey