Choosing Your Next Programming Language
summary
Argues there is no single best paradigm and advocates choosing by concrete tradeoffs: implements a small Hindley-Milner type inference in F# to show the constraint generation and unification steps, then re-expresses those constraints as Datalog in Racket and gets answers with virtually no extra code, and uses Racket macros to emit 6502 and run it on a C64 emulator (AC64) to prove high-level metaprogramming can generate low-level working binaries. Uses Van Roy’s 27-paradigm analysis and Kuhn-style adoption reasoning.
AI-written summary · about
chapters (8)
- 0:00Start
- 0:57Programming Paradigms
- 6:23Dependency Management
- 18:55Definition of Programming Paradigm
- 21:36Type Inference Algorithm
- 21:46Type Inference
- 23:12Build the Constraints
- 28:36Commodore 64 Emulator
related talks
46mPhilosophical sources of progr. paradigms in a nutshell
53mMulti-Paradigm Programming and Beyond
36mConcrete Functional Programming
44mFunctional Programming You Already Know
01h 36mThe Benefits of Learning a Different Programming Language
41mEvolving Functional Programming Languages
56mFunctional Programming on .NET - The Best of Both Worlds
58mKeynote: Why Functional Programming Matters