Hi, I would like to know how you would implement bitstrings "à la APL", meaning bitstrings/bitvectors of arbitrary dimensions with packed representation and possibilities for implicit parallelism.
I am under the impression that this essentially means adding a bit type to the numeric tower, but I don't really know where to begin. Any suggestion would be welcome. I asked about bitstrings (valued 1|0) implementation in racket on Reddit already [1]. I received several suggestions among which: - mapping Boolean bitvectors to integer vectors (which means no packed representation) - or using the "rebellion" package, which implements packed bitstrings, but the implementation is partially imperative, making me worried about parallelism perspectives. Thanks! Raoul [1] https://www.reddit.com/r/Racket/comments/btrscb/can_true_bitvectors_be_implemented_in_racket/?utm_medium=android_app&utm_source=share -- You received this message because you are subscribed to the Google Groups "Racket Users" group. To unsubscribe from this group and stop receiving emails from it, send an email to racket-users+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/racket-users/911abf34-f5b7-4c96-9e5b-d40f51d5378f%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
