Sample with fibonacci:

 is the fibonacci in this language

  • maegul (he/they)@lemmy.ml
    link
    fedilink
    English
    arrow-up
    15
    ·
    8 hours ago

    I tried to go through the tutorial a year or so ago.

    I can’t recall when, but there’s a point at which doing something normal/trivial in an imperative language requires all sorts of weirdness in Uiua. But they try to sell it as especially logical while to me they came off as completely in a cult.

    It’s this section, IIRC: https://www.uiua.org/tutorial/More Argument Manipulation#-planet-notation-

    When they declare

    And there you have it! A readable syntax juggling lots of values without any names!

    For

    ×⊃(+⊙⋅⋅∘|-⊃⋅⋅∘(×⋅⊙⋅∘)) 1 2 3 4

    Which, if you can’t tell, is equivalent to

    f(a,b,c,x) = (a+x)(bx-c)

    With arguments 1, 2, 3, 4.

    I wanted to like this, and have always wanted to learn APL or J (clear influences). But I couldn’t take them seriously after that.

  • ignirtoq@feddit.online
    link
    fedilink
    English
    arrow-up
    16
    ·
    9 hours ago

    This looks like someone took regular expressions, expanded them to a full programming language, and used Unicode to deal with the explosion of required symbols. I have a hard enough time reading my own regular expressions. I can’t imagine writing full programs like this.