question
active
question:shouldn-t-we-be-tempted-to-recode-these-programs-in-functional-languages-flip-the-autopilot-switch-lean-back-have-a-beer-and-leave-the-parallelizing-to-themShouldn’t we be tempted to recode these programs in functional languages, flip the autopilot switch, lean back, have a beer, and leave the parallelizing to them?
Rhetorical question about trusting compilers with parallelization.
Source paper
extracted_from(1989) · Carriero, Nicholas · Gelernter, David
Related by similarity (8)
cosine ≥ 0.65 · no typed edgeEntities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.
- Argument that recursion equations are inappropriate for many important parallel programs.
- Asserts that Linda's uncoupled style reduces cognitive load.
- Dynamic programming languages seem to spend much of their time looking up behaviour associatively.claim0.760An observation motivating the associative model as a unifying primitive.
- We hope that programs using performatives will be easier to write, understand, debug, modify and (above all) verify.hypothesis0.753Hope expressed about the benefits of Elephant-style programs.
- From Turner (1982), cited to represent the functional programming community's view and then refuted.
- Technical claim justifying pyvene's state-variable hook tracking for recurrent model support
- C-Linda DNA comparison is comparable in length and clarity to Crystal; pragmatic runtime granularity control outweighs compiler optimization ideals.
- Central design question underlying the comparison with functional approaches.