@jonsterling Yes, I have been using Haskell and "the hypothetical IO interpreter outside of Haskell", to make the point.
I need a pedagogical method by which to debunk the common idea that IO is special when it comes to pure FP programs.
-
-
- End of conversation
New conversation -
-
-
@jonsterling Do you have an example that works well for explanation?Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
@jonsterling Which language would you demonstrate this with?Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
@jonsterling I could do it in Haskell, but then I'd need (Hom L IO) in order to run the program, opening the same problem.Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
@jonsterling Why not honestly pure? Turing-completeness implies dishonesty -- I can buy that. Anything else?Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
@jonsterling exactly as I have been describing but I am falling to make the point in this case and I don't blame the student in any way. -
@dibblego Maybe get the idea that when the IO program runs it will have effects out of the way first. Our program constructs that IO prog.
End of conversation
New conversation -
-
-
@jonsterling I need a better explanation.Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
@jonsterling I think it comes down to this. Their notion of purity does not coincide with anything coherent but how to debunk it.Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.