487 search results - page 18 / 98 » Code Composition as an Implementation Language for Compilers |
PLDI
2009
ACM
14 years 2 months ago
2009
ACM
Dynamic languages such as JavaScript are more difficult to compile than statically typed ones. Since no concrete type information is available, traditional compilers need to emit...
PLDI
1995
ACM
13 years 11 months ago
1995
ACM
Compile-time type information should be valuable in efficient compilation of statically typed functional languages such as Standard ML. But how should type-directed compilation w...
TDM
2004
13 years 9 months ago
2004
This work may be seen as a further proof of the versatility of the relational database model. Here, we add XQuery to the catalog of languages which RDBMSs are able to "speak&...
PLDI
2009
ACM
14 years 2 months ago
2009
ACM
It is often impossible to obtain a one-size-fits-all solution for high performance algorithms when considering different choices for data distributions, parallelism, transformati...
PLDI
1996
ACM
13 years 11 months ago
1996
ACM
Two key steps in the compilation of strict functional languages are the conversion of higher-order functions to data structures (closures) and the transformation to tail-recursive...