Sciweavers

ICFP
1998
ACM
13 years 9 months ago
Recycling Continuations
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...
Jonathan Sobel, Daniel P. Friedman
ICFP
1998
ACM
13 years 9 months ago
Implementing Typed Intermediate Languages
Zhong Shao, Christopher League, Stefan Monnier
ICFP
1998
ACM
13 years 9 months ago
Functional Differentiation of Computer Programs
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...
Jerzy Karczmarczuk
ICFP
1998
ACM
13 years 9 months ago
Fold and Unfold for Program Semantics
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...
Graham Hutton
ICFP
1998
ACM
13 years 9 months ago
PLAN: A Packet Language for Active Networks
Michael W. Hicks, Pankaj Kakkar, Jonathan T. Moore...
ICFP
1998
ACM
13 years 9 months ago
Intensional Polymorphism in Type-Erasure Semantics
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...
Karl Crary, Stephanie Weirich, J. Gregory Morriset...
ICFP
1998
ACM
13 years 9 months ago
H/Direct: A Binary Foreign Language Interface for Haskell
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...
Sigbjorn Finne, Daan Leijen, Erik Meijer, Simon L....