Sciweavers

203 search results - page 16 / 41
» On Span Programs
Sort
View
POPL
2007
ACM
14 years 10 months ago
A concurrent constraint handling rules implementation in Haskell with software transactional memory
Constraint Handling Rules (CHR) is a concurrent committedchoice constraint logic programming language to describe transformations (rewritings) among multi-sets of constraints (ato...
Edmund S. L. Lam, Martin Sulzmann
POPL
2008
ACM
14 years 10 months ago
Automatic inference of stationary fields: a generalization of java's final fields
Java programmers can document that the relationship between two objects is unchanging by declaring the field that encodes that relationship to be final. This information can be us...
Christopher Unkel, Monica S. Lam
ESCIENCE
2006
IEEE
14 years 3 months ago
A Unified Data Grid Replication Framework
Modern scientific experiments can generate large amounts of data, which may be replicated and distributed across multiple resources to improve application performance and fault to...
Tim Ho, David Abramson
EMNLP
2010
13 years 7 months ago
Dual Decomposition for Parsing with Non-Projective Head Automata
This paper introduces algorithms for nonprojective parsing based on dual decomposition. We focus on parsing algorithms for nonprojective head automata, a generalization of head-au...
Terry Koo, Alexander M. Rush, Michael Collins, Tom...
GI
2007
Springer
14 years 4 months ago
Supporting Cross-Application Contexts with Dynamic User Interface Fusion
: Currently, user interfaces are defined by single applications but workflows may span multiple ones. In the result, users have to work with separated programs in parallel and de...
Pascal Bihler, Holger Mügge