| | |
Summary: Time Equations for
Lazy Functional (Logic) Languages
Elvira Albert1
, Josep Silva2
, and Germ´an Vidal2
1
DSIP, Universidad Complutense de Madrid
Email: elvira@sip.ucm.es
2
DSIC, Technical University of Valencia
Email: {jsilva,gvidal}@dsic.upv.es
Abstract. There are very few approaches to measure the execution
costs of lazy functional (logic) programs. The use of a lazy execution
mechanism implies that the complexity of an evaluation depends on its
context, i.e., the evaluation of the same expression may have different
costs depending on the degree of evaluation required by the different
contexts where it appears. In this paper, we present a novel approach to
complexity analysis of functional (logic) programs. We focus on the con-
struction of equations which compute the time-complexity of expressions.
In contrast to previous approaches, it is simple, precise--i.e., it computes
|
