claim
active
claim:elephant-programs-themselves-can-be-represented-as-sentences-of-logic-their-extensional-properties-follow-from-this-representation-without-an-intervening-theory-of-programming-or-anything-like-hoare-axiomsElephant programs themselves can be represented as sentences of logic. Their extensional properties follow from this representation without an intervening theory of programming or anything like Hoare axioms.
Fourth abstract claim.
Neighborhood — ranked by edge-count
Papers (1)
paper
Claims (1)
claim
- No special theory of programming is required to prove properties of programs if they are expressed as logical sentences.extendssupportsKey claim of the Algol 48/50 and Elephant approach.
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.
- Fifth abstract claim.
- Rejection of one of Dorschel's conditions for happy performance.
- McCarthy's position against Searle: computers can genuinely promise without requiring Searle's conditions (e.g., belief that fulfillment benefits recipient).
- Sixth abstract claim.
- Elephant source programs may not need data structures, because they can refer directly to the past.claim0.792Third abstract claim.
- Advantage of speech acts over plain strings.
- Seventh abstract claim.
- It seems likely that the simple cases will be most useful in the initial applications of Elephant 2000 and similar languages.hypothesis0.764Prediction about initial usage.