1675 search results - page 225 / 335 » Some thoughts on teaching programming and programming langua... |
TACS
1991
Springer
14 years 1 months ago
1991
Springer
System F is a well-known typed λ-calculus with polymorphic types, which provides a basis for polymorphic programming languages. We study an extension of F, called F<: (pronoun...
DAGSTUHL
1996
13 years 11 months ago
1996
The so called "cogen approach" to program specialisation, writing a compiler generator instead of a specialiser, has been used with considerable success in partial evalua...
ICFP
2004
ACM
14 years 10 months ago
2004
ACM
Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive higher-...
ICS
2010
Tsinghua U.
14 years 3 months ago
2010
Tsinghua U.
The emergence of multicore processors has increased the need for simple parallel programming models usable by nonexperts. The ability to specify subparts of a bigger data structur...
APLAS
2009
ACM
14 years 4 months ago
2009
ACM
Abstract. Context-sensitive points-to analysis is critical for several program optimizations. However, as the number of contexts grows exponentially, storage requirements for the a...