13 search results - page 1 / 3 » On Copy Avoidance in Single Assignment Languages |
ICLP
1993
Springer
13 years 9 months ago
1993
Springer
: Copy avoidance refers to the safe replacement, at compile time, of copying operations by destructive updates in single-assignment languages. Conceptually, the problem can be divi...
ICLP
1997
Springer
13 years 9 months ago
1997
Springer
Array updates in single assignment languages generally require some copying of the array, and thus tend to be more expensive than in imperative languages. As a result, programs in...
APLAS
2005
ACM
13 years 11 months ago
2005
ACM
This paper presents a novel method to construct a dynamic single assignment (DSA) form of array-intensive, pointer-free C programs (or in any other procedural language). A program ...
ICLP
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. Logic variables pioneered by (concurrent) logic and concurrent constraint programming are powerful mechanisms for automatically synchronizing concurrent computations. The...
CL
2004
Springer
13 years 5 months ago
2004
Springer
In the context of meta-programming and reflective languages, classes are treated as full fledged objects which are instances of other classes named metaclasses. Metaclasses have p...