On 2013/05/26 07:56P, Alaric Snell-Pym wrote: > That issue already holds for lists and vectors; one needs to check > up-front if they contain any closures or other non-printable objects to > tell if they are printable.
But such a test for printability isn't possible for hash tables as proposed. As you say, the printability of a list or vector is just a function of its contents, so Scheme already provides the substrate for e.g. `list-printable?`. This isn't the case for hash tables, and a way to interrogate a table about its equivalence would also be needed. Evan _______________________________________________ Scheme-reports mailing list [email protected] http://lists.scheme-reports.org/cgi-bin/mailman/listinfo/scheme-reports
