Sciweavers

FSTTCS
1991
Springer
15 years 8 months ago
Randomizing Reductions of Search Problems
This paper closes a gap in the foundations of the theory of average case complexity. First, we clarify the notion of a feasible solution for a search problem and prove its robustne...
Andreas Blass, Yuri Gurevich
DCC
1994
IEEE
15 years 8 months ago
Compression By Induction of Hierarchical Grammars
Craig G. Nevill-Manning, Ian H. Witten, David Maul...
FPCA
1991
15 years 8 months ago
Syntactic Detection of Single-Threading Using Continuations
We tackle the problem of detecting global variables in functional programs. We present syntactic criteria for single-threading which improves upon previous solutions (both syntact...
Pascal Fradet
FPCA
1991
15 years 8 months ago
Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire
We develop a calculus for lazy functional programming based on recursion operators associated with data type de nitions. For these operators we derive various algebraic laws that ...
Erik Meijer, Maarten M. Fokkinga, Ross Paterson