Sciweavers

632 search results - page 3 / 127
» Explicit Substitutions and Programming Languages
Sort
View
FPCA
1987
13 years 11 months ago
Categorical multi-combinators
: Categorical Multi-Combinators form a rewriting system developed with the aim of providing efficient implementations of lazy functional languages. The core of the system of Catego...
Rafael Dueire Lins
LCPC
1995
Springer
13 years 11 months ago
V-cal: A Calculus for the Compilation of Data Parallel Languages
V-cal is a calculus designed to support the compilation of data parallel languages that allows to describe program transformations and optimizations as semantics preserving rewrite...
P. F. G. Dechering, J. A. Trescher, J. P. M. de Vr...
GI
2008
Springer
13 years 8 months ago
Explicit Language and Infrastructure Support for Context-aware Services
: Dealing with context information is an important concern for mobile service computing. However, modern frameworks and programming languages do not directly support context-depend...
Malte Appeltauer, Robert Hirschfeld
AOSD
2007
ACM
13 years 11 months ago
A case for explicit join point models for aspect-oriented intermediate languages
Aspect-oriented languages mostly employ implicit languagedefined join point models, where well-defined points in the program are called join points and declarative predicates are ...
Hridesh Rajan
PLDI
2000
ACM
13 years 11 months ago
Off-line variable substitution for scaling points-to analysis
Most compiler optimizations and software productivity tools rely on information about the effects of pointer dereferences in a program. The purpose of points-to analysis is to com...
Atanas Rountev, Satish Chandra