12 search results - page 1 / 3 » Tag-Free Combinators for Binding-Time Polymorphic Program Ge... |
FLOPS
2010
Springer
14 years 17 days ago
2010
Springer
Abstract. Binding-time polymorphism enables a highly flexible bindingtime analysis for offline partial evaluation. This work provides the tools to translate this flexibility into...
LOPSTR
2004
Springer
14 years 24 days ago
2004
Springer
Offline partial evaluation techniques rely on an annotated version of the source program to control the specialisation process. These annotations guide the specialisation and have ...
OOPSLA
2005
Springer
14 years 28 days ago
2005
Springer
Parametric polymorphism has become a common feature of mainstream programming languages, but software component architectures have lagged behind and do not support it. We examine ...
ICFP
1997
ACM
13 years 11 months ago
1997
ACM
General media-processing programs are easily expressed with bitaddressing and variable-sized bit-fields. But the natural implementation of bit-addressing relies on dynamic shift ...
SIGMOD
1989
ACM
13 years 11 months ago
1989
ACM
Machiavelli is a polymorphically typed programming language in the spirit of ML, but supports an extended method of type inferencing that makes its polymorphism more general and a...