Josef
Josef
``` beginTabBar beginTabItem beginTooltip bullet bulletText button calcItemWidth calcListClipping captureKeyboardFromApp captureMouseFromApp checkbox checkboxFlags ```
Another weird thing: the following expressions returns the correct output `###:a ###c` ```elm @Y #f :#x :f :x x #x :f :x x -- data Bits = Empty | O...
`/Y I`, `/Y #r #x /r /succ x`, `/Y #r #x /succ /r x` loops endlessly (reduction is never finished) as expected. What is interesting tho, all of those infinite...
To make the task simpler you might think of annotating each argument with set of all possible input values: ```elm @N #c #n n @C #x #xs #c #n //c...
> Do you have any paper describing a type system like that one you described? I don't think i've seen a type system which works by simply listing all possible...
Then we should at least make a file, where we put all before => after transformations, which allowed fusion, so we can make some sense of it.
For example I still do not understand, why does `fmap` require `identity` to not loop forever. Do you have any explanation for it?
As an example in [theorems for free](http://ecee.colorado.edu/ecen5533/fall11/reading/free.pdf) polymorphism is used to derive theorems about terms.
Please, yes! That would be very useful in combination with eye tracking software.
One thing to note is that **church encoding does not play well with laziness**. In contrary, Scott encoding does not hamper lazy evaluation in any way.