Sciweavers

ICFP
2002
ACM
14 years 10 months ago
Shortcut fusion for accumulating parameters & zip-like functions
We present an alternative approach to shortcut fusion based on the function unfoldr. Despite its simplicity the technique can remove intermediate lists in examples which are known...
Josef Svenningsson
ICFP
2002
ACM
14 years 10 months ago
Compiling scheme to JVM bytecode: : a performance study
We have added a Java virtual machine (henceforth JVM) bytecode generator to the optimizing Scheme-to-C compiler Bigloo. We named this new compiler BiglooJVM. We have used this new...
Bernard P. Serpette, Manuel Serrano
ICFP
2002
ACM
14 years 10 months ago
Tagless staged interpreters for typed languages
Multi-stage programming languages provide a convenient notation for explicitly staging programs. Staging a definitional interpreter for a domain specific language is one way of de...
Emir Pasalic, Walid Taha, Tim Sheard
ICFP
2002
ACM
14 years 10 months ago
Type classes with more higher-order polymorphism
We propose an extension of Haskell's type class system with bstractions in the type language. Type inference for our extension relies on a novel constrained unification proce...
Matthias Neubauer, Peter Thiemann
ICFP
2002
ACM
14 years 10 months ago
Meta-programming with names and necessity
Meta-programming is a discipline of writing programs in a certain programming language that generate, manipulate or execute programs written in another language. In a typed settin...
Aleksandar Nanevski
ICFP
2002
ACM
14 years 10 months ago
Modular typechecking for hierarchically extensible datatypes and functions
Todd D. Millstein, Colin Bleckner, Craig Chambers
ICFP
2002
ACM
14 years 10 months ago
Composing monads using coproducts
Monads are a useful abstraction of computation, as they model diverse computational effects such as stateful computations, exceptions and I/O in a uniform manner. Their potential ...
Christoph Lüth, Neil Ghani