1559 search results - page 175 / 312 » Fundamentals of Generic Programming |
TAPSOFT
1997
Springer
15 years 2 months ago
1997
Springer
This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C...
VL
1994
IEEE
15 years 2 months ago
1994
IEEE
The notion of icons in visual environments is limited by perceiving icons as tacit entities that have meaning only to human beings and not to the machines that display them. This ...
ECOOP
2010
Springer
15 years 1 months ago
2010
Springer
Domain-specific languages (DSLs) are increasingly used as embedded languages within general-purpose host languages. DSLs provide a compact, dedicated syntax for specifying parts o...
ACSC
2004
IEEE
15 years 1 months ago
2004
IEEE
Types are fundamental for enforcing levels of abstraction in modern high-level programming languages and their lower-level representations. However, some type-related features suc...
COCO
2006
Springer
15 years 1 months ago
2006
Springer
We study two quite different approaches to understanding the complexity of fundamental problems in numerical analysis. We show that both hinge on the question of understanding the...