11:09 <discocaml> <codebycc> Hi everyone I’m still experiencing troubles making on making contributions is anyone open to a zoom call or something to help me out

18:31 <discocaml> <kumnadin_31037> hi everyone i am call kum nadin i will please like to work on this project in Ocaml impliment a dark mode for ocaml.org. sorry for coming inn late😆

20:46 <discocaml> <barconstruction> I am trying to solve an exercise.

20:46 <discocaml> <barconstruction> It is not for a class, it is for my own edification.

20:49 <discocaml> <barconstruction> ```

20:49 <discocaml> <barconstruction> type 'a tree = Node of ('a * (('a tree) list))

20:49 <discocaml> <barconstruction> let map f = function

20:49 <discocaml> <barconstruction> | Node (x, c) -> (Node (f x), List.map (map f) c)

20:49 <discocaml> <barconstruction> ```

20:49 <discocaml> <barconstruction> I hope it is clear what this code does.

20:50 <discocaml> <barconstruction> It just applies the function `f` to every element in the tree.

20:50 <discocaml> <barconstruction> `map : ('a -> 'b) -> 'a tree -> 'b tree`

20:50 <discocaml> <Kali> you need `rec` after `let`, or `map` will be unbound in its body

20:50 <discocaml> <barconstruction> oh yeah lol

20:50 <discocaml> <barconstruction> ```

20:50 <discocaml> <barconstruction> type 'a tree = Node of ('a * (('a tree) list))

20:50 <discocaml> <barconstruction> let rec map f = function

20:50 <discocaml> <barconstruction> | Node (x, c) -> (Node (f x), List.map (map f) c)

20:50 <discocaml> <barconstruction> ```

20:50 <discocaml> <barconstruction> anyway

20:51 <discocaml> <Kali> just a note, edits here resend on the irc side— use #beginners for help

20:53 <discocaml> <Kali> your parentheses are also wrong, it should be `Node ((f x), List.map (map f) c)`

20:53 <discocaml> <barconstruction> The challenge is to implement this in a stack safe way for deep trees.

20:53 <discocaml> <barconstruction> I have thought of two ways of doing this.

20:53 <discocaml> <barconstruction> One involves keeping a fairly complicated accumulator using a list which contains the elements of the tree in reverse topological order, together with a map or similar data structure which keeps track of each node's parent.

20:53 <discocaml> <barconstruction> This I am pretty sure I can do but it seems ugly.

20:53 <discocaml> <barconstruction>

20:53 <discocaml> <barconstruction> The second solution would be to use continuation passing style. This seems like it could be more elegant, but I can't figure out how to do it.

20:53 <discocaml> <barconstruction> I would like a hint or suggestion as to how it is implemented.

20:53 <discocaml> <barconstruction> yeah sorry discord doesn't have syntax highlighting or merlin or whatever.

20:54 <discocaml> <Kali> it does, though: use \`\`\`ocaml rather than just \`\`\`

20:54 <discocaml> <barconstruction> oh that's neat.

20:55 <discocaml> <Kali> let's move to #beginners

21:52 <discocaml> <Et7f3 (@me on reply)> but you want to translate to what ? another human language for article ? or you want to migrate from php ? I know a tool for the opposite https://github.com/jordwalke/rehp

21:53 <h0rror> 5.1.0 has been out for some weeks, the topic should be updated :)

23:29 <src> I expected to run out of stack space with regards to the `take` function, but I don't when I run this in utop... are both functions somehow tail recurisve by chance?

23:29 <src> https://godbolt.org/z/GrEvv5eGh

23:30 <src> (I didn't really set out to write them tail recursive, I just wrote them and no they work w/out running out of stack space, so I'm surprised...)

23:30 <src> s/no/now