Original post 1. There is a typo in the description of DLC level "split", whose first example lacks an argumemt. - SPLIT ((1) 3 (4)) -> ((1), (3 (4))) should be - SPLIT ((1) 3 (4)) 2 -> ((1), (3 (4))) 2. Cannot upload levels to Steam Workshop. After clicking the "upload" button, a message box will show that Uploading to steam Error uploading: Error calling Steam: a file was not found Solution 1. The typo was fixed. 2. Using A a...

The first time I started the game the window was large, but I could move it around to see everything. Now the window is twice the size of my desktop! The game is unplayable. Why can't I change the size of the window? Is there a config file somewhere?

I tried to read some of the documentation on the github wiki: https://yancouto.github.io/functional/functional/index.html But that is very technical documentation for someone new to this. I have no idea what the purpose of these equations are or what kind of real life purpose this has or what field of math / logic this is in.. I am hooked though, I want to understand it and maybe try creating some of my own levels someday. It seems like this is aimed at those with an already good understanding of these ...

The game just starts for a split second and then shuts down by itself. This is weird since I downloaded the demo before purchasing the game and that worked fine.

Would someone be willing to explain to me how to solve the squaring level, but explain the answer in detail? I have read about lambda calculus but cannot seem to relate the notation for lambda calculus to the notation for this game, and I understand the examples of course, but I can't even begin to understand how to implement a solution. I am barely on the cusp of understanding how this works and would really like to understand better....

The expected result of the test case #0 of "NODE" is (f: f L V R) . Any function inside "f:" will not be reduced, which means that simply an answer of l: v: NOT (f: r: f l v r) will fail on test case #0, and anyone can see that this answer is 100% the same as the expected answer l: v: r: f: f l v r . I think it is obviously a bug....

Is there a key that exits the sticky selection cursor mode? I keep accidentally deleting half my work.

I can invoke `(f: f x) y` and wind up with `y x` thereby shifting y to the left of x. There doesn't seem to be a way to do the opposite. I can't do `x <func of y> -> y x`. Is that a feature of lambda calculus, or am I just missing something?

I was thinking this should be simplify to TRUE but playground gives me x; y: TRUE x (FALSE x y) Could someone explain it? thx

Any chance for Steam achievements?