Sciweavers

161 search results - page 12 / 33
» Lazy call-by-value evaluation
Sort
View
PPDP
2000
Springer
13 years 11 months ago
A model for comparing the space usage of lazy evaluators
Identifying the source of space faults in functional programs is hard. The problem is compoundedas space usage can vary enormously from one implementation to another. We use a ter...
Adam Bakewell, Colin Runciman
IFL
2000
Springer
135views Formal Methods» more  IFL 2000»
13 years 11 months ago
Freja, Hat and Hood - A Comparative Evaluation of Three Systems for Tracing and Debugging Lazy Functional Programs
Abstract. In this paper we compare three systems for tracing and debugging Haskell programs: Freja, Hat and Hood. We evaluate their usefulness in practice by applying them to a num...
Olaf Chitil, Colin Runciman, Malcolm Wallace
ICPR
2002
IEEE
14 years 8 months ago
Fast Face Detection with Precise Pose Estimation
We present a fast algorithm for face detection and precise pose estimation. Our detection scheme is based on a tree-structured hierarchy of face vs. background classifiers combine...
Donald Geman, François Fleuret
SAC
2004
ACM
14 years 1 months ago
A back-end for GHC based on categorical multi-combinators
is an abstract graph reduction machine for the implementation of lazy functional languages. Categorical multi-combinators served as a basis for the evaluation model of µΓCMC. Th...
Ricardo Massa Ferreira Lima, Rafael Dueire Lins, A...