We hope that programs using performatives will be easier to write, understand, debug, modify and (above all) verify.

Entities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.

• Abstract performatives include purely internal actions such as commitments not necessarily expressed in output, but on whose fulfillment the correctness of the program depends.quote0.801
  Definition of abstract performative, a core invention of the paper.
• Proving that a program meets accomplishment specifications must be based on assumptions about the world, the information it makes available to the program and the effects of the program's actions as well as on facts about the program itself.claim0.786
  Claim about the nature of accomplishment verification.
• The correctness of programs is partly defined in terms of proper performance of the speech acts. Answers should be truthful and responsive, and promises should be kept. Sentences of logic expressing these forms of correctness can be generated automatically from the form of the program.claim0.766
  Second abstract claim.
• Explicitly parallel programs are not inherently harder to design or understand than functional specifications.claim0.763
  C-Linda DNA comparison is comparable in length and clarity to Crystal; pragmatic runtime granularity control outweighs compiler optimization ideals.
• Developing a simple, precise denotational model of graphical user interfaces enables proving properties of programs and establishing objective comparisons of library abstraction levels.claim0.762
  Authors' core assertion that formal modeling of GUIs provides foundational benefits for language design and program verification.
• The Elephant programmer in verifying his program need not show that the promise will be fulfilled because it was made. It is enough that he show it will be fulfilled.claim0.760
  Rejection of one of Dorschel's conditions for happy performance.
• A skill should do its work and stop, avoiding performative complexity and multi-stage flows when single-pass suffices.claim0.759
• If indeed the programs are so complex, then it is likely that they, too, will be potentially subject to hundreds of thousands, perhaps millions of egregious mistakes of adaptation.hypothesis0.755
  Extends the mistake analysis from buildings to software, predicting that complex programs without generating processes will be full of adaptation failures.