[Ur] Combinator Parsing in Ur: Anonymous function remains at code generation

Adam Chlipala adamc at csail.mit.edu
Sat Jul 26 09:28:47 EDT 2014


On 07/22/2014 03:47 PM, orchidaceae phalaenopsis wrote:
>> Can you point me to a full program demonstrating this problem?
>>      
> Here is the test-case for this https://gist.github.com/enn/7a6fb1d62b88e2f8bf89
>    

The issue there was just another compiler bug, which is fixed now.

>> Why do you want lazy evaluation?
>>      
> Mentioned in the parsec paper, delaying there is an algorithmic
> speedup that enables it to ignore a branch that it would otherwise
> check.
>    

But does your particular use case need that sort of strategy?  Can you 
show me a concrete example to motivate the requirement?



More information about the Ur mailing list