@Fmbalbuena So, if you put ⍨ on the immediate right of a dyadic function, you get a monadic function that uses the same single argument as both arguments. E.g. +⍨10 gives 20 and ×⍨10 gives 100
They take one (in this case) or two parameters we call operands, and create a new derived function.
E.g. ⍨ can take + and creates the "double" function.
⍨ can take × and creates the "square" function.
Btw, you can also use the derived function dyadically. In that case, F⍨ derives a new function which is exactly like the dyadic function F except it takes the arguments in swapped order.
The delete control character (also called DEL or rubout) is the last character in the ASCII repertoire, with the code 127. It is supposed to do nothing and was designed to erase incorrect characters on paper tape. It is denoted as ^? in caret notation and is U+007F in Unicode.
Terminal emulators may produce DEL when ← Backspace key or Control+← Backspace or Control+? are typed.
== History ==
This code was originally used to mark deleted characters on punched tape, since any character could be changed to all ones by punching holes everywhere. If a character was punched erroneously, punching out...
@Fmbalbuena Yes, but then it isn't a joke, is it? Dyadic | is division remainder when its right argument is divided by its left argument. It isn't mod of mathematics or other programming languages.
And while I agree that having swapped arguments would have been most consistent with ÷, by far most uses need a complex expression as the value(s) being divided, and a single number as divisor, so | is easiest to use the way it is. Otherwise, you'd have to write |⍨ all the time.
A quine is a computer program which takes no input and produces a copy of its own source code as its only output. The standard terms for these programs in the computability theory and computer science literature are "self-replicating programs", "self-reproducing programs", and "self-copying programs".
A quine is a fixed point of an execution environment, when the execution environment is viewed as a function transforming programs into their outputs. Quines are possible in any Turing-complete programming language, as a direct consequence of Kleene's recursion theorem. For amusement, programmers...
'''1⌽,⍨9⍴''' the characters '1⌽,⍨9⍴' 9⍴ reshape to shape 9, resulting in '1⌽,⍨9⍴'' ,⍨ concatenate with itself, resulting in '1⌽,⍨9⍴'''1⌽,⍨9⍴'' 1⌽ rotate one character to the left, getting the characters: 1⌽,⍨9⍴'''1⌽,⍨9⍴'''
11⍴'''1⌽22⍴11⍴''' → '''1⌽22⍴11⍴''''' which prints as '1⌽22⍴11⍴''
22⍴11⍴'''1⌽22⍴11⍴''' → 22⍴'''1⌽22⍴11⍴''''' → '''1⌽22⍴11⍴''''''1⌽22⍴11⍴''''' which prints as '1⌽22⍴11⍴'''1⌽22⍴11⍴''
1⌽22⍴11⍴'''1⌽22⍴11⍴''' → 1⌽22⍴'''1⌽22⍴11⍴''''' → 1⌽'''1⌽22⍴11⍴''''''1⌽22⍴11⍴''''' → '1⌽22⍴11⍴''''''1⌽22⍴11⍴''''''' which prints as 1⌽22⍴11⍴'''1⌽22⍴11⍴'''
@Fmbalbuena OK, for when you come back (I have to go soon too): Define a dyadic function To that takes two numbers, the left being smaller or equal to the right, and returns the range. E.g. 3 To 8 should give 3 4 5 6 7 8
@hyper-neutrino You should be able to hit 8, while 5 is possible as a tacit function. Still, these solutions are not efficient, and now what I had in mind for Fmbalbuena, as I only planned on them using what I've taught them.
@Adám ah, okay, thanks. i've unfortunately forgotten pretty much all of apl's tacit rules due to never using them so i'm getting it confused with jelly, so i'll take this as a good exercise and try to get it to 5 using tacit
hover gets me somewhat close but it's not quite correct (on top of being too long). not sure if it's the right approach but i have to go for a bit as well
No, i'm writing a dyadic function To that takes two numbers, the left being smaller or equal to the right, and returns the range. E.g. 3 To 8 should give 3 4 5 6 7 8