Differences between version 23 and predecessor to the previous major change of WhyIHatePerl.
Other diffs: Previous Revision, Previous Author, or view the Annotated Edit History
| Newer page: | version 23 | Last edited on Monday, September 5, 2005 12:12:31 pm | by JaredUpdike | Revert |
| Older page: | version 22 | Last edited on Thursday, September 1, 2005 9:40:31 pm | by AristotlePagaltzis | Revert |
@@ -163,4 +163,8 @@
[3] I claim that arbitrarily-nested compound data structures (lists, dictionaries/hashes and all possible nestings) are simple things. Any book on Scheme will cover them in the earliest of chapters.
[4] When I say "work right the first time" I usually mean syntactically or semantically, not algorithmically or without bugs. But there have been those times when even a complex algorithm I wrote worked the first time: it happens sometimes in Python and frighteningly often in Haskell (or OCaml). And while I'm talking about Haskell, the best thing is that it DOES change the way I think, giving me newer and better and higher ways to things (I didn't even really know were possible to do!) that you really CAN'T do in Perl, despite the big-time claim that Perl let's you do anything you want, even unintended things. %%% ''[Disagree. | http://hop.perl.plover.com/] Also, I have this exact experience with Perl; I think of something, and the first time I write it down, it works. Syntactically, always; in terms of logic, about 80% of the time. Maybe that's why I am so fond of the language and why you are not. --AristotlePagaltzis''
+
+I think I understand your point now. It's all in how you're used to looking at things and how you like to look at things. Perl is just very different, with a higher bar to entry (which many do not get over, including me!) and very different from how I like to do things.
+
+My last jab is that I meant by "things work right the first time" that "things work right the first time ''the first week'' I've been programming in that language at all!" Truthfully, even Python did not do this for me, but OCaml (and Haskell) did: I coded Random Search Trees the first week I had ever touched OCaml (despite the fact that OCaml is very different from anything I had seen before that time) and once I got it to compile, it ''worked right the first time''. If you coded something as subtle as Random Search Trees in Perl the first week of touching Perl and it worked literally ''the first time'' you ran the program, then I bow to you and Perl. Cheers! --JaredUpdike.
