705 search results - page 9 / 141 » New Compilation Languages Based on Structured Decomposabilit... |
102
click to vote
CGO
2011
IEEE
14 years 1 months ago
2011
IEEE
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
COLING
1996
14 years 11 months ago
1996
Automatic compilation of the linking relation employed in certain parsing algorithms for context-free languages is examined. Special problems arise in the extension of these algor...
108
click to vote
IEEEPACT
2009
IEEE
14 years 7 months ago
2009
IEEE
As the gap between processor and memory continues to grow, memory performance becomes a key performance bottleneck for many applications. Compilers therefore increasingly seek to m...
SAIG
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. Functional languages are particularly well-suited to the implementation of interpreters for domain-specific embedded languages (DSELs). We describe an implemented techniq...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Synchronous languages rely on formal methods to ease the development of applications in an efficient and reusable way. Formal methods have been advocated as a means of increasing t...