Sciweavers

189 search results - page 3 / 38
» Semantics of a Functional BSP Language with Imperative Featu...
Sort
View
POPL
2008
ACM
14 years 7 months ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume
ENTCS
2008
146views more  ENTCS 2008»
13 years 7 months ago
Probabilistic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions
istic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions Michael J. A. Smith1 ,2 Laboratory for Foundations of Computer Science University of Edinb...
Michael J. A. Smith
ICTCS
2005
Springer
14 years 29 days ago
A Typed Semantics of Higher-Order Store and Subtyping
Abstract. We consider a call-by-value language, with higher-order functions, records, references to values of arbitrary type, and subtyping. We adapt an intrinsic denotational mode...
Jan Schwinghammer
CORR
2010
Springer
79views Education» more  CORR 2010»
13 years 7 months ago
Variable elimination for building interpreters
In this paper, we build an interpreter by reusing host language functions instead of recoding mechanisms of function application that are already available in the host language (t...
Julien Cohen, Jean-Louis Giavitto, Olivier Michel
PLDI
2011
ACM
12 years 10 months ago
Safe optimisations for shared-memory concurrent programs
Current proposals for concurrent shared-memory languages, including C++ and C, provide sequential consistency only for programs without data races (the DRF guarantee). While the i...
Jaroslav Sevcík