Beefy Boxes and Bandwidth Generously Provided by pair Networks
"be consistent"
 
PerlMonks  

Re^2: Code Readability. Break Rule Number 5?

by DACONTI (Scribe)
on Apr 19, 2007 at 20:51 UTC ( [id://611032]=note: print w/replies, xml ) Need Help??


in reply to Re: Code Readability. Break Rule Number 5?
in thread Code Readability. Break Rule Number 5?

I supposed there was already somebody before...
However APL was born 50 years ago and then it was dying again.
I think this idea has a right to a 2nd chance...

UPDATE: sorry APL seem actually to be alive. In wikipedia they speak very good about this language, so why do not port these ideas also to other languages?
Ciao, DACONTI

  • Comment on Re^2: Code Readability. Break Rule Number 5?

Replies are listed 'Best First'.
Re^3: Code Readability. Break Rule Number 5?
by rodion (Chaplain) on Apr 21, 2007 at 06:37 UTC
    I remember writing APL for a part-time job in college, quite some time ago. The language was powerful, and compact. However, when I went back to a piece of code that I hadn't looked at in two weeks, the compact and powerful nature of the language made it hard to read. It was often denser and harder to read than mathematical proofs. Sometimes it was faster to re-write the code from scratch than to read it, so it was, to some extent, a write-only language.
      I remember writing Perl for a part-time job in college, quite some time ago. The language was powerful, and compact. However, when I went back to a piece of code that I hadn't looked at in two weeks, the compact and powerful nature of the language made it hard to read. [...] Sometimes it was faster to re-write the code from scratch than to read it, so it was, to some extent, a write-only language.

      Sorry, couldn't resist


      holli, /regexed monk/
      Beyond the humor, you end up making my point well, perhaps better than I did.

      I've sometimes found "map" leading me into stacking functions 'till they look like a Schwartzian Transform gone wrong, but I never have found Perl leading me towards writing at the density of a mathematical proof. Regular expressions certainly get dense and obtuse without the "/x" modifier, but they stay in their own restircted string context. Nothing's ever come close to the APL experience for leading me down the path of unintentional obscurity.

Re^3: Code Readability. Break Rule Number 5?
by blazar (Canon) on Apr 22, 2007 at 13:20 UTC
    UPDATE: sorry APL seem actually to be alive. In wikipedia they speak very good about this language, so why do not port these ideas also to other languages?

    Who tells you they're not? Again I don't have fresh references, but I'm sure to have heard it mentioned in p6l, along with a ton of other known and less known languages. And you bet that if it's a good idea, than $Larry won't ignore it!

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://611032]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others learning in the Monastery: (5)
As of 2024-04-18 15:10 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found