SP/k

From Wikipedia, the free encyclopedia
SP/k
Paradigm(s) structured, imperative
Appeared in 1974
Designed by R.C. Holt, D.B. Wortman, D.T. Barnard, J.R. Cordy
Developer R.C. Holt, D.B. Wortman, D.T. Barnard, J.R. Cordy
Stable release SP/8
Typing discipline static, strong
Influenced by PL/I
Influenced Turing

    SP/k is a programming language developed circa 1974[1] by R.C. Holt, D.B. Wortman, D.T. Barnard and J.R. Cordy as a subset of the PL/I programming language designed for teaching programming. It was used for about a decade at over 40 universities, schools, and research laboratories in Canada and the United States.

    SP/k was one of the first languages specifically designed to encourage structured programming. The features of SP/k were chosen to encourage structured problem solving by computers, to make the language easy to learn and use, to eliminate confusing and redundant constructs, and to make the language easy to compile.The resulting language was suitable for introducing programming concepts used in various applications, including business data processing, scientific calculations and non-numeric computation.

    SP/k is actually a sequence of language subsets called SP/1, SP/2, … SP/8. Each subset introduces new programming language constructs while retaining all the constructs of preceding subsets, forming a stepwise system for teaching computer programming. Each subset is precisely defined and self-contained, and can be learned or implemented without the following subsets. This allows for various levels of programming education. The design and philosophy of SP/k was a strong influence on the Turing programming language.

    See also

    • PL/C

    References

    1. Holt, Richard; Wortman, D. (February 1974). "A sequence of structured subsets of PL/I". Retrieved 2009-09-17. 

    External links

    This article is based on material taken from the Free On-line Dictionary of Computing prior to 1 November 2008 and incorporated under the "relicensing" terms of the GFDL, version 1.3 or later.

    This article is issued from Wikipedia. The text is available under the Creative Commons Attribution/Share Alike; additional terms may apply for the media files.