Böhm-Jacopini정리 ( Böhm-Jacopini theorem )

주제(Subject)
--------------------------------------------------------
한글(약어) : Böhm-Jacopini정리()
영어(약어) : Böhm-Jacopini theorem()


관련개념(Related Concepts)
--------------------------------------------------------
구조적 프로그래밍(structured programming)


개요(Summary)
--------------------------------------------------------
모든 제어흐름은 세 가지(순차,선택,반복) 기본 구조를 적용하여 표현할 수 있다


본문(Body)
--------------------------------------------------------
1. 개념

The structured program theorem is a result in programming language theory. It states that every computable function can be implemented in a programming language that combines subprograms in only three specific ways. These three control structures are

1. Executing one subprogram, and then another subprogram (sequence)
2. Executing one of two subprograms according to the value of a boolean variable (selection)
3. Executing a subprogram until a boolean variable is true (iteration)

Computer scientists usually credit the theorem to a 1966 paper by Corrado Böhm and Giuseppe Jacopini. However, David Harel traced its origins to the 1946 description of the von Neumann architecture and Stephen Kleene's normal form theorem.

                                                  - from Wikipedia : Structured program theorem

모임,단체(Commutities)
--------------------------------------------------------


블로그,개인 홈페이지 등(Humanities)
--------------------------------------------------------


참고문서(References)
--------------------------------------------------------
* 한국어(Korean)
저자. 역자. "제목". 출판사. 출판년도. (ISBN:)

* 영어(English)
저자. 제목, 판, 출판사. 출판년도. (ISBN:)
1. Wikipedia : Structured Programming
   http://en.wikipedia.org/wiki/Structured_programming

2. Wikipedia : Structured Program Theorem
   http://en.wikipedia.org/wiki/B%C3%B6hm-Jacopini_theorem

3. Google Search : type [[Böhm-Jacopini site:*.edu]]@google
   http://www.google.com/search?source=ig&hl=en&q=B%C3%B6hm-Jacopini+site%3A*.edu