This is the mail archive of the guile@cygnus.com mailing list for the guile project.
Index Nav: | [Date Index] [Subject Index] [Author Index] [Thread Index] | |
---|---|---|
Message Nav: | [Date Prev] [Date Next] | [Thread Prev] [Thread Next] |
> How do you know that a reference is dynamic? When it is not in lexical scope. > In which cases is the dynamic binding list searched? When performing a dynamic lookup (unless optimized). But note the dynamic binding list was only used to define the *semantics* - there is no requirement that the implementation be as I suggested. For example we can still use the existing caching methods, as long as we can inexpensively invalidate the cache on a fluid-let. > This solution puts rather tight demands on the implementation, doesn't > it? Huh? All solutions put tight demands on the implementation - the latter needs to implement the specification. The question is what kind of language you want. Using fluid-let is a relatively elegant and powerful solution, which is in the Scheme tradition, and has already been implemented in other Scheme dialects. It also provides a mechanism to easily implement Emacs Lisp semantics - just map ELisp let into fluid-let. --Per Bothner Cygnus Solutions bothner@cygnus.com http://www.cygnus.com/~bothner