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.

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

• 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.802
  Rejection of one of Dorschel's conditions for happy performance.
• For some purposes, it will be convenient to settle for specifications in terms of fulfilling internal commitments, and sometimes the public character of promises will have to be taken into account in the specifications.claim0.793
  Trade-off between internal and public obligations.
• Elephant programs that interact non-trivially with the outside world can have both input-output specifications, relating the programs inputs and outputs, and accomplishment specifications concerning what the program accomplishes in the world. These concepts are respectively generalizations of the philosophers' illocutionary and perlocutionary speech acts.claim0.789
  Fifth abstract claim.
• We hope that programs using performatives will be easier to write, understand, debug, modify and (above all) verify.hypothesis0.786
  Hope expressed about the benefits of Elephant-style programs.
• 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.784
  Second abstract claim.
• Perhaps we will need three levels of specification, internal, input-output and accomplishment.hypothesis0.783
  Speculation about specification hierarchy.
• No special theory of programming is required to prove properties of programs if they are expressed as logical sentences.claim0.782
  Key claim of the Algol 48/50 and Elephant approach.
• We evaluate the relative life of a process by making predictions based on thought-experiments or simulations.claim0.779