You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Currently compiling code with the --lazy flag incurs a quite heavy performance overhead (e.g. the slowdown is over 10x on Triples.agda). If we could analyze which arguments are always used by a given function, then we could avoid creating delay thunks for those arguments and instead evaluate them strictly. I started implementing this analysis in 2834874, but it is not yet clear to me how to do this analysis properly for mutually recursive functions.
The text was updated successfully, but these errors were encountered:
Currently compiling code with the
--lazy
flag incurs a quite heavy performance overhead (e.g. the slowdown is over 10x on Triples.agda). If we could analyze which arguments are always used by a given function, then we could avoid creatingdelay
thunks for those arguments and instead evaluate them strictly. I started implementing this analysis in 2834874, but it is not yet clear to me how to do this analysis properly for mutually recursive functions.The text was updated successfully, but these errors were encountered: