I don't think you would be interested as it is entirely internal to TR. We have a bunch of functions, (infer, subtype, var-promote, var-demote, substitute, etc) that need to traverse the type and do things on it. Currently many of them are hardcoded match loops, and this is work to make them less repetative, and easier to add new cases to all of them.
Examples of code that I want to eventually replace: https://github.com/plt/racket/blob/master/pkgs/typed-racket-pkgs/typed-racket-lib/typed-racket/types/subtype.rkt#L481 On Mon, May 26, 2014 at 4:11 PM, Neil Toronto <neil.toro...@gmail.com> wrote: > On 05/26/2014 09:21 AM, endob...@racket-lang.org wrote: >> >> >> 9efa4af Eric Dobson <endob...@racket-lang.org> 2014-05-16 08:13 >> : >> | Make initial version of structural type recursion, and use it. >> : >> A >> pkgs/typed-racket-pkgs/typed-racket-lib/typed-racket/types/structural.rkt >> M .../typed-racket/infer/promote-demote.rkt | 66 >> +++++++++++--------- >> M .../typed-racket/rep/type-rep.rkt | 8 ++- > > > I'm trying to figure out how excited I should be about this. Can you explain > it a little? > > Neil ⊥ > > _________________________ Racket Developers list: http://lists.racket-lang.org/dev
