« first day (1710 days earlier)      last day (659 days later) » 

5:43 AM
in flax, 14 mins ago, by lyxal
Just off the top of my head, it could involve something like <nilad> <nilad> <triad> <nilad>
^ thoughts on flax having triadic links?
 
5:54 AM
Triads don't naturally fit the tacit, one dimensional language design
You can go up to quad-arg functions with 2D tacit langs such as Jellyfish, but generally, you stick to dyads max with tacitness
 
@cairdcoinheringaahing what if i need 6 args :P
 
Use a list, and treat it as a monad :P
 
are there 3d languages
 
@cairdcoinheringaahing but what if you added chaining rules that sort of replicated triadic behaviour?
for example, this extension of the monadic chaining rule:
Pattern : curr =
2 3 Ǎ   :  Ǎ(2, 3, curr) -> (2).Ǎ(3, curr)
2 Ǎ 3   :  Ǎ(curr, 2, 3) -> curr.Ǎ(2, 3)
+ × Ǎ 2 :  Ǎ(curr + alpha, curr × alpha, 2) -> (curr + alpha).Ǎ(curr × alpha, 2)
A 1 Ǎ 2 :  Ǎ(A(curr), 1, 2) -> A(curr).Ǎ(1, 2)
Ǎ +     :  Ǎ(curr, alpha, alpha + curr) -> curr.Ǎ(alpha, curr + alpha)
Ǎ I     :  Ǎ(curr, alpha, I(alpha)) -> curr.Ǎ(alpha, I(alpha))
Ǎ 2     :  Ǎ(curr, alpha, 2) -> curr.Ǎ(alpha, 2)
Ǎ       :  Ǎ(curr, alpha, alpha) -> curr.Ǎ(alpha, alpha)
also,
Let Ǎ, Ǐ, Ǒ be triads
    +, ÷, × be dyads
    A, I, O be monads
    1, 2, 3 be nilads
 
@PyGamer0 Yes, I've written one
 
6:08 AM
@cairdcoinheringaahing link?
 
 
2 hours later…
8:36 AM
yeah there's just no good way to do 1d tacit triads
i've sort of thought of doing some wack stack shit but it's hard to think of a good way to pull that off either
if one of the arguments you're thinking of would naturally have to be a positive integer one option would be to have a dyad returning an infinite list or some shit like that
 
8:57 AM
has anyone implemented a tacit lang in C?
 

« first day (1710 days earlier)      last day (659 days later) »