-
as seen on Stack Overflow
- Search for 'Stack Overflow'
It's not a practically important issue, but could you please provide me with an example of tacit programming in F# where my `pointless' functions can have multiple arguments (not in form of list or tuple);
And secondly, where those functions can manipulate a complex data structure. I'm trying to…
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
Hi!
I have a question about what exact role do higher-order compinators (or function producers) hold in concatenative/tacit programming.
Additionally I would like to ask if there is another way to implement concatenative programming language rather than directly manipulating the stack.
This might…
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
I've solved 84 of the Project Euler problems, mostly in Haskell. I am now going back and trying to solve in J some of those I already solved in Haskell, as an exercise in learning J.
Currently, I am trying to solve Problem 56. Let me stress that I already know what the right answer is, since I've…
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
I've been working on a J function for a while, that's supposed to scan a list and put consecutive copies of an element into separate, concatenated boxes. My efforts have taken me as far as the function
(<;. 2) ((2&(~:/\)),1:)
which tests successive list entries for inequality, returns a…
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
If you're not familiar with the Rowland prime sequence, you can find out about it here. I've created an ugly, procedural monadic verb in J to generate the first n terms in this sequence, as follows:
rowland =: monad define
result =. 0 $ 0
t =. 1 $ 7
while. (# result) < y do.
…
>>> More
