We are currently releasing older YOW! videos to serve as a valuable archive, preserving historical content. It is possible that a video is perceived as outdated. We believe it offers insightful glimpses into the past, enriching our understanding of history and development.
Just wanted to say I am absolutely loving the YOW uploads, thank you very much, it would have been a shame if all this amazing content never hit the internet.
Interesting to look at the development times in the table at 33:19 as well. Lisp having a 3 hour development time. and only 12 lines of documentation. Whereas haskell had 465 lines of documentation.
It would be fun to see the implementations and see what could be improved with each. It has been a decade since I read the paper, but IIRC, the Lisp team finished first and the code worked, with many of the other attempts not working error-free. That would leave 5 hours at least to work on the algorithm.
Awesome talk, thanks! For anyone interested in Backus paper but too rookie to read it, check Eric Normands podcast about it where he reads parts of it and adds explanation
We are currently releasing older YOW! videos to serve as a valuable archive, preserving historical content. It is possible that a video is perceived as outdated. We believe it offers insightful glimpses into the past, enriching our understanding of history and development.
Just wanted to say I am absolutely loving the YOW uploads, thank you very much, it would have been a shame if all this amazing content never hit the internet.
Fantastic talk! Get right to the heart of the question of why we need FP.
Interesting to look at the development times in the table at 33:19 as well. Lisp having a 3 hour development time. and only 12 lines of documentation. Whereas haskell had 465 lines of documentation.
It would be fun to see the implementations and see what could be improved with each. It has been a decade since I read the paper, but IIRC, the Lisp team finished first and the code worked, with many of the other attempts not working error-free. That would leave 5 hours at least to work on the algorithm.
Beautiful ❤
Awesome talk, thanks! For anyone interested in Backus paper but too rookie to read it, check Eric Normands podcast about it where he reads parts of it and adds explanation