#MJD explaining how #design-patterns are signs of weakness in #programming-languages
on 02026-05-04Commentary by #pozorvlak (Miles Gould) about how some #programming-languages don’t have adequate abstraction facilities to move some #design-patterns into a library, forcing programmers to implement them over and over again
on 02026-05-04UNITY is an experimental language by K. Mani Chandy and Jayadev Misra from 01988 based on #Dijkstra’s #guarded-commands. #programming-languages
on 02025-08-02Casey #Muratori’s keynote about, largely, #disjoint-unions and how it is sad that #C++ doesn’t have them. “I’m not saying OOP was a mistake. I’m saying this [a compile-time hierarchy of encapsulation that matches the domain model] was a mistake.” Also traces the #history of records in #programming-languages through Simula and Hoare’s record-handling paper and the “plex” of Douglass Ross of the MIT Servomechanisms Laboratory in AED, Algol Extended for Design, and also #Sketchpad, which had in-memory records (“chickens”) linked together in circular linked lists, which apparently was an idea he got from Ross (“n-component elements”). Both Ross’s plexes and Sketchpad had function pointers in the records. (But the constraint solver was “the most unencapsulated thing that you could possibly imagine”.) Also documents how Looking Glass in 01998 introduced the #Entity-Component-System pattern in Ultima II Underworld, but really introduced it with Tom Leonard’s Thief: The Dark Project. At 82'40” he points out that he independently invented a worse version of ECS at definitionSIX for Negaman in 01997. “It’s just, I sucked at it, and Looking Glass was good.” Basically his “35-year mistake” thesis is that we almost had ECS in 01963 with Sketchpad, but it took until 01998. He likens 01990s OOP dogma to playing Magic: The Gathering, which I think is insightful. At 136'45” he tells his devotee Ryan Fleury that he has snatched the stone from his hand and may now leave. Nice quote: “You should focus on the hardest stuff. You should say, ‘what solves the hardest problems?’ because we can always then take that and scale it down, and remove things from it or dumb it down, for people to use in cases that aren't as hard. But it’s almost impossible to take something that only solves simple problems and scale it up to something that solves hard ones.”
on 02025-07-22#PDF of Tony Hoare’s 01966 “Record Handling” #paper, which may be the origin in #history of #disjoint-unions in #programming-languages.
on 02025-07-21Graydon Hoare on the #history of #disjoint-unions (sum types) in #programming-languages, which are central to ML but were in Algol 68 and Mesa, but not Pascal or Modula-2.
on 02025-07-21#history of why we “call” functions; the metaphor was that we use a “call number” to “call up” a subroutine out of a “subroutine library” #programming-languages
on 02025-07-20