I introduced the A* notation with the thought that our algorithm (A*) was better than any other algorithm, better than anyone else's algorithm A, and we're gonna prove it!
Peter Hart, as cited in A* Search: What's in a Name? by James W. Davis, Jeff Hachtel (https://doi.org/10.1145/3326600)
We begin by defining a category of files and patches, where the operation of merging the effect of two coinitial patches is defined by pushout. Since two patches can be incompatible, such a pushout does not necessarily exist in the category, which raises the question of which is the correct category to represent and manipulate files in conflicting state. We provide an answer by investigating the free completion of the category of files under finite colimits, and give an explicit description of this category: its objects are finite sets labeled by lines equipped with a transitive relation and morphisms are partial functions respecting labeling and relations.
Samuel Mimram, Cinzia Di Giusto: A Categorical Theory of Patches (https://doi.org/10.1016/j.entcs.2013.09.018)
Disney and Apple/Microsoft are in the same business: short-circuiting laborious, explicit verbal communication with expensively designed interfaces.
Defunctionalize the Continuation!
Productivity per CPU cycle per Watt is the lowest it’s been in decades, and is orders of magnitude (plural) beneath its potential.
