Sciweavers

117
Voted
ICFP
2007
ACM
16 years 3 months ago
Faster laziness using dynamic pointer tagging
In the light of evidence that Haskell programs compiled by GHC exhibit large numbers of mispredicted branches on modern processors, we re-examine the "tagless" aspect of...
Simon Marlow, Alexey Rodriguez Yakushev, Simon L. ...
136
Voted
ICFP
2007
ACM
16 years 3 months ago
A type directed translation of MLF to system F
The MLF type system by Le Botlan and R?emy (2003) is a natural extension of Hindley-Milner type inference that supports full firstclass polymorphism, where types can be of higher-...
Daan Leijen
106
Voted
ICFP
2007
ACM
16 years 3 months ago
Compiling with continuations, continued
Andrew Kennedy
109
Voted
ICFP
2007
ACM
16 years 3 months ago
Call-pattern specialisation for haskell programs
User-defined data types, pattern-matching, and recursion are ubiquitous features of Haskell programs. Sometimes a function is called with arguments that are statically known to be...
Simon L. Peyton Jones
150
Voted
ICFP
2007
ACM
16 years 3 months ago
Relating complexity and precision in control flow analysis
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
David Van Horn, Harry G. Mairson
111
Voted
ICFP
2007
ACM
16 years 3 months ago
Functional pearl: the great escape or, how to jump the border without getting caught
Filinski showed that callcc and a single mutable reference cell are sufficient to express the delimited control operators shift and reset. However, this implementation interacts p...
David Herman
124
Voted
ICFP
2007
ACM
16 years 3 months ago
Feedback directed implicit parallelism
In this paper we present an automated way of using spare CPU resources within a shared memory multi-processor or multi-core machine. Our approach is (i) to profile the execution o...
Tim Harris, Satnam Singh
131
Voted
ICFP
2007
ACM
16 years 3 months ago
A generic usage analysis with subeffect qualifiers
Sharing analysis and uniqueness typing are static analyses that aim at determining which of a program's objects are to be used at most once. There are many commonalities betw...
Jurriaan Hage, Stefan Holdermans, Arie Middelkoop
126
Voted
ICFP
2007
ACM
16 years 3 months ago
Implicit phasing for R6RS libraries
The forthcoming Revised6 Report on Scheme differs from previous reports in that the language it describes is structured as a set of libraries. It also provides a syntax for defini...
Abdulaziz Ghuloum, R. Kent Dybvig
124
Voted
ICFP
2007
ACM
16 years 3 months ago
Experience report: building an eclipse-based IDE for Haskell
This paper summarizes experiences from an open source project that builds a free Haskell IDE based on Eclipse (an open source IDE platform). Eclipse is extensible and has proved t...
Leif Frenzel