Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Programming Language

P′′

Structured Language

P double prime is a minimalist programming language created by the mathematician Corrado Bohm in 1964 to describe a family of Turing machines. Its instruction set, built around a small number of primitive operations for incrementing and comparing values and structuring control flow, gave one of the earliest formal demonstrations of the single-entry, single-exit principle that later became central to structured programming. Bohm's work on P double prime predates and influenced Edsger Dijkstra's later advocacy for structured programming, and the language remains cited in computer science as an early example of a Turing-complete language reduced to a handful of primitive constructs.

Facts
First Released
1964 1
Connections

In Field

Source P'' (Wikipedia)

Invented By

Source P'' (Wikipedia)
Sources
1. P'' (Wikipedia)
  • Lead section
    P'' (P double prime) is a primitive computer programming language created by Corrado Böhm in 1964 to describe a family of Turing machines.
  • In Field: Programming Language Theory, Lead sentence
    P′′ (P double prime) is a primitive computer programming language created by Corrado Böhm in 1964 to describe a family of Turing machines.
  • Invented By: Corrado Böhm, Lead sentence
    P′′ (P double prime) is a primitive computer programming language created by Corrado Böhm in 1964 to describe a family of Turing machines.
  • In Group: Structured Programming Languages, Lead
    P′′ (P double prime) is a primitive computer programming language created by Corrado Böhm in 1964 to describe a family of Turing machines. It provided one of the earliest formulations of the single-entry single-exit principle central to structured programming.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.