First thing that comes to mind for me are the series of articles presented at HOPL conferences, History of Programming Languages.
HOPL II (1993) https://dl.acm.org/doi/proceedings/10.1145/154766
HOPL III (2007) https://dl.acm.org/doi/proceedings/10.1145/1238844
HOPL IV (2021) https://dl.acm.org/do/10.1145/event-12215/abs/
https://dl.acm.org/doi/10.1145/1165555.1165556
Aggregability is NP-Hard... Useful the next time someone insists that it's possible to find a "perfect" model for a non-trivial ML problem. (I get this ask 1-2 times per month.)
Ask HN: Favorite Articles in the ACM Digital Library - https://news.ycombinator.com/item?id=46460953
First thing that comes to mind for me are the series of articles presented at HOPL conferences, History of Programming Languages.
HOPL II (1993) https://dl.acm.org/doi/proceedings/10.1145/154766
HOPL III (2007) https://dl.acm.org/doi/proceedings/10.1145/1238844
HOPL IV (2021) https://dl.acm.org/do/10.1145/event-12215/abs/