Alex Knauth

The correct point of control for most of this is in @lexi-lambda's [struct-update](https://github.com/lexi-lambda/struct-update) package. There should be an issue for handling inheritance on that.

There is now an issue for this on that repository https://github.com/lexi-lambda/struct-update/issues/1

I don't agree that error messages for using subtypes would be good. If `B` is a subtype of `A` then the `A` operations should work without error on `B` things....

It violates it if equality of `foo`s is defined as `equal?`. However if you define `foo=?` as ``` racket (define (foo=? x y) (and (equal? (foo-a x) (foo-a x)) (equal?...

Is there a way to declare structs as `final`? That's what this weirdness makes me want.

With https://github.com/lexi-lambda/struct-update/pull/3, this is what I'm planning to do. For these structs: ``` racket (struct foo (a b c)) (struct sub (c a t)) ``` The form `(define-struct-lenses foo)` would...

But this would have to recur into the fields, so I think it would require a more general read/write lens anyway, right? Or would `prefab-struct-isomorphism-lens` take arguments for handling that,...

What you said in (https://github.com/jackfirth/lens/issues/267#issuecomment-163824481) about `lens-join/struct` made me think that of the cases where you might want to re-order the fields, a lot of those could be cases where...

(Edit: I now use `make-tick`, `make-key`, etc. instead) What should I do about name conflicts? The way to give it events to test with is with things like `(tick)`, `(key...

(Edit: I now use `make-tick`, `make-key`, etc. instead) For `check-big-bang*`, I need `(tick)`, `(key "a")`, `(mouse 100 50 "button-down")` etc. to be values. If I were to overload `on-tick`, then...