🚀 go-pugleaf

dat@ukc.ac.uk (D.A.Turner) writes:

> There  is  no  special  difficulty  in
>reasoning   about  the  *time*  complexity  of  programs  written  in  a
>non-strict  functional  language.   One  can  derive  from  the  program
>equations   for  functions  fi  say,  similar  equations  for  Tfi,  the
>time-to-execute of function fi.

It seems to me that this is insufficient.  It basically tells us that it's
possible to write accurate profilers.  The real question is:  Are the Tfi
sufficiently simple for real programs that I can understand what's going
on, and use them to drive my algorithm design? 

>There is quite  a  nice  discussion  of
>this,   with   some   examples,  in  chapter  6  of  Bird  and  Wadler's
>"Introduction to Functional Programming".
>
>On the other  hand  reasoning  about  the  *space*  complexity  of  such
>programs seems to be much more difficult.

>David Turner

Hans-J. Boehm