Get to know Jacopini better with 4 real example sentences.
Jacopini in a sentence
Using Jacopini
- In the example corpus, jacopini often appears in combinations such as: and jacopini, böhm jacopini.
Context around Jacopini
- Average sentence length in these examples: 20 words
- Position in the sentence: 2 start, 2 middle, 0 end
- Sentence types: 4 statements, 0 questions, 0 exclamations
Corpus analysis for Jacopini
- In this selection, "jacopini" usually appears near the start of the sentence. The average example has 20 words, and this corpus slice is mostly made up of statements.
- Around the word, published, possibly and canonical stand out and add context to how "jacopini" is used.
- Recognizable usage signals include article böhm jacopini and böhm and jacopini possibly because. That gives this page its own corpus information beyond isolated example sentences.
- By corpus frequency, "jacopini" sits close to words such as aaai, aani and aarne, which helps place it inside the broader word index.
Example types with jacopini
The same corpus examples are grouped by length and sentence type, making it easier to see the contexts in which the word appears:
The Böhm–Jacopini canonical structures are made of these primitive shapes. (11 words)
What Böhm and Jacopini's article showed was that all programs could be goto-free. (15 words)
Minimal structured control flow seeAlso In May 1966, Böhm and Jacopini published an article Böhm, Jacopini. (16 words)
However, authors usually credit the result to a 1966 paper by Böhm and Jacopini, possibly because Dijkstra cited this paper himself. citation The structured program theorem does not address how to write and analyze a usefully structured program. (38 words)
Minimal structured control flow seeAlso In May 1966, Böhm and Jacopini published an article Böhm, Jacopini. (16 words)
What Böhm and Jacopini's article showed was that all programs could be goto-free. (15 words)
Example sentences (4)
Minimal structured control flow seeAlso In May 1966, Böhm and Jacopini published an article Böhm, Jacopini.
However, authors usually credit the result to a 1966 paper by Böhm and Jacopini, possibly because Dijkstra cited this paper himself. citation The structured program theorem does not address how to write and analyze a usefully structured program.
The Böhm–Jacopini canonical structures are made of these primitive shapes.
What Böhm and Jacopini's article showed was that all programs could be goto-free.
Common combinations with jacopini
These word pairs occur most frequently in English texts: