114 search results - page 18 / 23 » Meta Languages in Algebraic Compilers |
IFL
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. In this report a new backward strictness analysis for functional languages is presented. It is called higher order demand propagation and is applicable to a realistic non...
PLDI
2011
ACM
14 years 10 days ago
2011
ACM
We consider the problem of specifying combinations of data structures with complex sharing in a manner that is both declarative lts in provably correct code. In our approach, abst...
CODES
1994
IEEE
15 years 1 months ago
1994
IEEE
We present an experimental framework for mapping declarative programs, written in a language known as Ruby, into various combinations of hardware and software. Strategies for para...
LCPC
2001
Springer
15 years 1 months ago
2001
Springer
This paper deals with the problem of statically inferring the shape of an array in languages such as MATLAB. Inferring an array’s shape is desirable because it empowers better co...
IPPS
2007
IEEE
15 years 3 months ago
2007
IEEE
The excessive complexity of both machine architectures and applications have made it difficult for compilers to statically model and predict application behavior. This observatio...