Thanks very much for that explanation. I've got two further comments. First, a sufficiently clever compiler could arrange that (lambda (j) (h j)) have the same tag as h and thereby, with an eqv? that checks tags rather than just addresses, preserve R5RS eqv?.
Second, the R6RS semantics would be more convincing if they were justified on the basis of real code rather than artificial examples. I understand that's difficult. I also understand that you're never going to convince everyone; I have long given up worrying about factors of two. Regards, Alan _______________________________________________ r6rs-discuss mailing list r6rs-discuss@lists.r6rs.org http://lists.r6rs.org/cgi-bin/mailman/listinfo/r6rs-discuss
