Sciweavers

ICFP
2004
ACM
14 years 4 months ago
Relating models of backtracking
Past attempts to relate two well-known models of backtracking computation have met with only limited success. We relate these two models using logical relations. We accommodate hi...
Mitchell Wand, Dale Vaillancourt
ICFP
2004
ACM
14 years 4 months ago
Translating dependency into parametricity
Abadi et al. introduced the dependency core calculus (DCC) as a unifying framework to study many important program analyses such as binding time, information flow, slicing, and fu...
Stephen Tse, Steve Zdancewic
ICFP
2004
ACM
14 years 4 months ago
Implementing functional logic languages using multiple threads and stores
Recent functional logic languages such as Curry and Toy combine lazy functional programming with logic programming features including logic variables, non-determinism, unification...
Andrew P. Tolmach, Sergio Antoy, Marius Nita
ICFP
2004
ACM
14 years 4 months ago
Multi-return function call
It is possible to extend the basic notion of "function call" to allow functions to have multiple return points. This turns out to be a surprisingly useful mechanism. Thi...
Olin Shivers, David Fisher
ICFP
2004
ACM
14 years 4 months ago
Types, potency, and idempotency: why nonlinearity and amnesia make a type system work
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...
Harry G. Mairson, Peter Møller Neergaard
ICFP
2004
ACM
14 years 4 months ago
Making a fast curry: push/enter vs. eval/apply for higher-order languages
Higher-order languages that encourage currying are implemented using one of two basic evaluation models: push/enter or eval/apply. Implementors use their intuition and qualitative...
Simon Marlow, Simon L. Peyton Jones
ICFP
2004
ACM
14 years 4 months ago
Scrap more boilerplate: reflection, zips, and generalised casts
Writing boilerplate code is a royal pain. Generic programming promises to alleviate this pain by allowing the programmer to write a generic "recipe" for boilerplate code...
Ralf Lämmel, Simon L. Peyton Jones
ICFP
2004
ACM
14 years 4 months ago
From process logic to program logic
We present a process logic for the -calculus with the linear/affine type discipline (Berger et al. 2001; Berger et al. 2003; Honda and Yoshida 2002; Honda and Yoshida 2003; Honda ...
Kohei Honda
ICFP
2004
ACM
14 years 4 months ago
Generics for the masses
A generic function is a function that can be instantiated on many data types to obtain data type specific functionality. Examples of generic functions are the functions that can b...
Ralf Hinze