Hello, dear colleagues! Could you, please, answer some of my questions? 1) Is there any paper about how the Racket engine works? 2) Is there any guide or a paper about effective (in terms of semantics execution) Redex usage?
I want to know it because I'm interested in optimizing my semantics in Redex. What I want to find in aforementioned papers: - Are environments and holes effective, or I should use them rarely? - Is there any factorization of states during the reduction process? - ... Background story: I'm working on highly non-deterministic semantics for a concurrent language using PLT/Redex. Unfortunately, I faced a performance problem --- an execution of some tests, which aren't so big, takes too much time (> 40 minutes). Originally, I though that the problem was in my heap representation and I should have factorized it. But an execution of a smaller test w/ only 280 states according to `traces` and w/o any heap-related problems takes 30 seconds, which is still too much in my opinion. --- Best regards, Anton Podkopaev, PhD student, SPbSU -- 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. For more options, visit https://groups.google.com/d/optout.
