115
Voted
ICFP
1998
ACM
15 years 9 months ago
1998
ACM
125
Voted
ICFP
1998
ACM
15 years 9 months ago
1998
ACM
141
click to vote
ICFP
1998
ACM
15 years 9 months ago
1998
ACM
If the continuations in functional data-structure-generating programs are made explicit and represented as records, they can be recycled." Once they have served their purpose...
129
Voted
ICFP
1998
ACM
15 years 9 months ago
1998
ACM
114
Voted
ICFP
1998
ACM
15 years 9 months ago
1998
ACM
165
Voted
ICFP
1998
ACM
15 years 9 months ago
1998
ACM
We present a purely functional implementation of the computational differentiation tools — the well known numeric (i.e., not symbolic) techniques which permit one to compute poin...
131
Voted
ICFP
1998
ACM
15 years 9 months ago
1998
ACM
In this paper we explain how recursion operators can be used to structure and reason about program semantics within a functional language. In particular, we show how the recursion...
119
Voted
ICFP
1998
ACM
15 years 9 months ago
1998
ACM
142
Voted
ICFP
1998
ACM
15 years 9 months ago
1998
ACM
Intensional polymorphism, the ability to dispatch to different routines based on types at run time, enables a variety of advanced implementation techniques for polymorphic languag...
132
Voted
ICFP
1998
ACM
15 years 9 months ago
1998
ACM
H/Direct is a foreign-language interface for the purely functional language Haskell. Rather than rely on host-language type signatures, H/Direct compiles Interface Definition Lang...