Nathanaëlle Courant

Thanks! As I said on IRC (repeating it here for the record), the idea is to replace the interpreter written in OCaml by one written in C. That way, it...

What is JoJo? The language is named "joujou" because that word means more or less "toy" or "plaything" in French.

While I agree it is ok if there are limitations, I find it a completely different matter to have limitations and to silently return an incorrect result! Besides, it seems...

Hmmm, I think I don't understand why `map (map f) l` is fine, at least if `map` is a lambda-bound function. (Imagine we are in Haskell and this function `map2`...

Ah, I thought creating copies of `map f` would create copies of `map`, but I guess I'm mistaken about it. I've seen more than once your example above of writing...

Ah, that makes it clearer, thank you! However, with this definition, I still think the Y-combinator will be undefined behavior.

In the Y-combinator case, it is neither the function it receives nor the Y-combinator which copies itself, but the `(\r. f (r r))` subterm. If we expand the body of...

@VictorTaelin (it seems like I can't reopen the issue, since you were the one to close it, however).

I agree, the Y-combinator works correctly, even if it is undefined behaviour. In fact, what I think happens is that we get a duplication confusion (which often produces errors), but...

With the following code I get incorrect results (as expected): ``` (Map Nil f) = Nil (Map (Cons x xs) f) = (Cons (f x) (Map xs f)) (Main arg)...