Polytechnical Careering
summary
Argues that career value comes from concrete breadth: learn languages and stores, build domain-specific tools, and reuse ideas across platforms. Cites Haskell list/stream concepts feeding Java streams/iterators, recommends Prolog or rule engines for constrained logic, and graph stores for genealogy. Gives a real example: a volunteer-built campaign system handling 10,000 requests/sec, 180 TB, 8.5B requests deployed and torn down in 18 months, showing polytechnical stacks can scale and work.
AI-written summary · about
chapters (29)
- 0:00Introduction
- 2:23What is Polytechnical Careering
- 2:38Polyglot
- 4:33Limitations
- 6:35Why
- 9:23Complex permutations
- 13:46DevOps
- 16:42Constraint Logic
- 18:27Domain Experts
- 21:47Ancestry
- 23:21Relational Database
- 25:59This Could Never Work
- 26:33The Obama Campaign
- 28:03Haskell
- 30:44List Comprehension
- 32:22Infinite Lists
- 34:06Streams
- 34:20Collections
- 36:29Iterators
- 37:43Functional Languages
- 39:01Infinite Streams
- 41:31How do you do this
- 48:22Learn a new language
- 49:57Create your own evaluation function
- 51:47Learn something else
- 52:11If youre the boss
- 52:28Brown bag
- 56:50Core business
- 58:21Acceptance
related talks
58mBusy Developer’s Guide to Polytechnical Engineering
13mCareer Development
25mRethinking the Developer Career Path
54mCareer Advice for Programmers
01h 29mBuilding a Career In Programming
44mCareer Abroad - How the best Technologists are conquering the World
38mJoy - Maintaining Passion for Programming
43mNon-linear paths to tech are the new black!
