Sciweavers

ICFP
2003
ACM
14 years 7 months ago
CDuce: an XML-centric general-purpose language
Alain Frisch, Giuseppe Castagna, Véronique ...
ICFP
2003
ACM
14 years 7 months ago
Disjunctive normal forms and local exceptions
All classical -terms typable with disjunctive normal forms are shown to share a common computational behavior: they implement a local exception handling mechanism whose exact work...
Emmanuel Beffara, Vincent Danos
ICFP
2003
ACM
14 years 7 months ago
Optimistic evaluation: an adaptive evaluation strategy for non-strict programs
Lazy programs are beautiful, but they are slow because they build many thunks. Simple measurements show that most of these thunks are unnecessary: they are in fact always evaluate...
Robert Ennals, Simon L. Peyton Jones
ICFP
2003
ACM
14 years 7 months ago
Scripting the type inference process
To improve the quality of type error messages in functional programming languages, we propose four techniques which influence the behaviour of constraint-based type inference proc...
Bastiaan Heeren, Jurriaan Hage, S. Doaitse Swierst...
ICFP
2004
ACM
14 years 7 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 7 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 7 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 7 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 7 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 7 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