705 search results - page 9 / 141 » New Compilation Languages Based on Structured Decomposabilit... |
156
click to vote
CGO
2011
IEEE
14 years 7 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 ...
133
Voted
COLING
1996
15 years 4 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...
159
Voted
IEEEPACT
2009
IEEE
15 years 1 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...
129
Voted
SAIG
2000
Springer
15 years 7 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...
130
Voted
CORR
2008
Springer
15 years 3 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...