Hacker Timesnew | past | comments | ask | show | jobs | submitlogin

What about APL? The quicksort example from http://rosettacode.org/wiki/Sorting_algorithms/Quicksort reads:

qsort ← {1≥⍴⍵:⍵⋄ e← ⍵[?⍴⍵]⋄ (∇(⍵<e)/⍵), ((⍵=e)/⍵), ∇(⍵>e)/⍵}

Unlike J, all the brackets/parens/etc are balanced, and the functions and operators have single-character names.

Having played with both APL and J, I find APL to be easier to read. J was really just an experiment, adding rank matching and forks and hooks to APL, as well as using ASCII only for syntax. It doesn't take long to remember the keys for entering the non-ASCII characters into APL, and it looks more readable than J.

I think a future programming language should have precedences for its operators, though.



Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: