last day (106 days later) » 

Lyxal
Lyxal
00:03
10/10 room name
also, first.
user
user
Aw, come on, @Lyxal. I'm not first even in my own room?
Lyxal
Lyxal
no
not unless you post first
Bubbler
Bubbler
So the ideas are:
- the only data type is a stack of stacks of stacks of ...
- a while loop can be as "loop while the top of the stack is not empty"
- pushing the stack at the top of the stack to the stack below it, popping an element from the (main) stack, swapping the two stacks on top
- some two-stack operations that move the top element between them (to simulate a tape for TC)
- recurse into top stack
2
user
user
Do you have any ideas on how recursing into the top stack would work? I don't have much experience with this kind of stuff.
Also, @Bubbler, how would the tape work?
Bubbler
Bubbler
00:19
It just works in theory because any stack and its element have the same type, so you can run the same kind of code on any stack, treating it as the main stack. I haven't thought of its usefulness yet
user
user
It'll help make it TC, I guess
How about an operation to pop all elements from the main stack and push them into a new stack, then push that new stack onto the main stack? (basically, enclose the main stack into another stack)
Bubbler
Bubbler
@user It's a common model of making a stack-based language TC, especially "two stacks with infinite implicit zeros at the bottom", which makes simulating Brainfxxk trivial
(as in Labyrinth)
user
user
So one stack would be like the left of the pointer, the other would be the right, and the top of one of them would be the current cell?
Bubbler
Bubbler
Exactly
user
user
Ah, I think I understand now
I've started a Wiki here.
Bubbler
Bubbler
00:31
I have a feeling that pure recursion model might fit the language better than a tape model
2
as in, push a copy of the entire stack, manipulate its elements, and then recurse into it
but I guess "manipulate its elements" necessitates the tape model anyway
user
user
01:02
I mean, we can do both
Oh, and there should also be something to duplicate the top element
2x-1
2x-1
meh, boring language...
I thought this language is going to use the Stack Exchange API.
Bubbler
Bubbler
01:26
@user I guess you can decide on specific instructions by solving some basic tasks
Duplicate top, discard top
Move top element of top stack to top of 2nd stack
Swap top two
(moving top element of 2nd stack to the top stack can be simulated with the two others, though you can include it for convenience)
I think "recurse into the top stack" can be a single instruction, as well as "return to the outer stack"
 
1 hour later…
Razetime
Razetime
02:46
@Bubbler I agree
is ysthakur even on this site
oh is that user
nvm
user
user
03:42
Yeah, that’s me
Razetime
Razetime
03:55
you're from india as well?
user
user
Yeah
Razetime
Razetime
yusss
 
14 hours later…
user
user
18:05
All right, I have a page for syntax now. Nothing's concrete yet, so feel free to propose syntax changes, different names for commands, add explanations, etc.
The main principle behind Stack Exchange must be the exchanging of stacks.
And also "Stacks all the way down," just because it's somewhat catchy.

  last day (106 days later) »