Timeline for Optimal reduction using token-passing nets
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 20, 2015 at 9:34 | comment | added | Anton Salikhmetov | I managed to derive a token-passing net implementation of optimal reduction codedot.dreamwidth.org/174955.html by introducing a waiting construct. However it results in too much overhead and significantly worse overall performance than call-by-need implementation by Sinot. | |
| Sep 22, 2015 at 17:21 | history | edited | Anton Salikhmetov | CC BY-SA 3.0 |
edited title
|
| Sep 22, 2015 at 16:19 | comment | added | Anton Salikhmetov | It might, indeed. I just asked this question there as well cstheory.stackexchange.com/questions/32602/… | |
| Sep 22, 2015 at 16:08 | comment | added | Noah Schweber | Might this be more appropriate at cs.stackexchange.com? | |
| Sep 22, 2015 at 15:44 | history | edited | Anton Salikhmetov | CC BY-SA 3.0 |
deleted 23 characters in body; edited tags
|
| Sep 17, 2015 at 17:03 | history | edited | Anton Salikhmetov | CC BY-SA 3.0 |
deleted 1 character in body
|
| Sep 17, 2015 at 16:41 | history | asked | Anton Salikhmetov | CC BY-SA 3.0 |