Il giorno ven 12 giu 2020 alle ore 10:57 Philip McGrath < [email protected]> ha scritto:
> On Fri, Jun 12, 2020 at 2:46 AM Catonano <[email protected]> wrote: > >> the original paper Andy Wingo refers to uses Haskell to express this >> operator and I can't read Haskell and I'm not willing to learn >> > > I'm confused about what you mean: in the version of "Applications of Fold > to XML Transformation", on Andy Wingo's blog > <https://wingolog.org/pub/fold-and-xml-transformation.pdf>, all of the > examples are in Scheme. Here is a version of the example from the paper > that will run in Racket—most of the code is just copied and pasted from the > figures > I'm referring to a paper titled: "A better XML parser through functional programming" by Oleg Kiselyov I'd like to understand how exactly I'm supposed to arrange the "up" and "down" functions that I should pass as arguments to Andy's operator What are these operators supposed to take as arguments ? And I was trying to start from the original paper Andy cites, because that's where the original operator is defined (in haskell) I know Andy's examples work But I don't understand why they do and what I should do to apply that thing to different use cases i was trying to understand, not just running the examples -- 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 [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/racket-users/CAJ98PDwHPDrk8OcmKnS8FMwRiPfSY4VMFXZtMR5_gcxV6QKkWg%40mail.gmail.com.
