On 14 Oct 2009, at 9:38 am, Ray Dillinger wrote: >> Simple. He doesn't care about static nature, and wants *everything* >> to be dynamic. > > Let the implementation find static relationships where they exist; > the programmer should need to think only about runtime.
Indeed. However, elegant constructs tend to not only be easy to reason about and powerful for the programmer; the really elegant ones are also easy to analyse to find static relationships. I am skeptical of elegant constructs that defy compiler analysis; my hunch is that there's a better one, yet to be found. Just look at the lambda calculus! It's trivial to find the free variables in an expression, to inline an application and reduce away until you run up against a free variable that you can do no more with, etc... > Bear ABS -- Alaric Snell-Pym Work: http://www.snell-systems.co.uk/ Play: http://www.snell-pym.org.uk/alaric/ Blog: http://www.snell-pym.org.uk/archives/author/alaric/ _______________________________________________ r6rs-discuss mailing list [email protected] http://lists.r6rs.org/cgi-bin/mailman/listinfo/r6rs-discuss
