Is there any library out there to count words in a scribble doc? If possible with a per-section breakdown? If not, I will have a go at having a library out to do just that.

OK, it turns out it’s trivial to implement one so just did that. However, please still let me know if there’s something mature out there.

@alama the racketfest link i find in ddg is broken: https://www.eventbrite.com/e/racketfest-registration-52898981277 What happened?

Oh, ok wow, no more eventbrite, we have a homepage now: https://racketfest.com/

@alama is on fire!

For those not following him on twitter:

I vaguely remembered there’s something like https://docs.racket-lang.org/htdp/index.html?q=test-engine#(part._.Testing) but haven’t tried that myself

tracing from build-engine and get-info, I got to here https://github.com/racket/htdp/blob/master/htdp-lib/test-engine/test-engine.rkt and there https://github.com/racket/htdp/blob/master/htdp-lib/test-engine/test-info.scm that’s probably how test info is collected and what’s reported from get-info. summarize-results could be useful too on the other hand, it’s probably also possible to parse the output and extract the # of passed tests

what i’ve done was to have my own tests and ran them using the sandbox evaluator (just eval or call-in-sandbox-context)

I have a PL question: does the applicative-order Y combinator really work?

As I understand, the distinction of the applicative-order and call-by-value is that the former can reduce redex inside lambdas (http://www.cs.cornell.edu/courses/cs6110/2014sp/Lectures/lec04.pdf).

Consider even the term (applicative-order) Y alone. The term seems to diverge in the applicative-order evaluation strategy:

(λ (f)
  ((λ (x) (f (λ (v) ((x x) v))))
   (λ (x) (f (λ (v) ((x x) v))))))
=>
(λ (f)
  (f (λ (v) (((λ (x) (f (λ (v) ((x x) v))))
              (λ (x) (f (λ (v) ((x x) v))))) v))))
=>
...

Do I misunderstand anything?