Turing Plus (programming language)
- Turing Plus (programming language)
Turing+ (Turing Plus) is a concurrent systems programming language based the Turing programming language designed by James Cordy and Ric Holt, then at the University of Toronto, in 1987. Some, but not all, of the features of Turing Plus were eventually subsumed into Object-Oriented Turing. Turing Plus extended original Turing with processes and monitors (as specified by C.A.R. Hoare) as well as language constructs needed for systems programming such as binary input-output, separate compilation, variables at absolute addresses, type converters and other features.
Turing Plus was explicitly designed to replace Concurrent Euclid in systems-programming applications. The TUNIS operating system, originally written in Concurrent Euclid, was recoded to Turing Plus in its MiniTunis implementation. Turing Plus has been used to implement several production software systems, including the TXL programming language.
References
* J.R. Cordy and R.C. Holt 1987. The Turing Plus Report. Technical report CSRI-214 (September 1987), Computer Systems Research Institute, University of Toronto.
* R.C,. Holt and D.A. Penny 1988. Concurrent Programming using Turing Plus Language. Computer Systems Research Institute, University of Toronto, 108 pp.
* R.C,. Holt and D.A. Penny 1988. The Concurrent Programming of Operating Systems using the Turing Plus Language. Computer Systems Research Institute, University of Toronto, 400 pp.
* [http://portal.acm.org/citation.cfm?id=43923 R.C. Holt 1988. Device management in Turing Plus. SIGOPS Operating Systems Review 22, 1 (Jan. 1988), 33-41.]
Wikimedia Foundation.
2010.
Look at other dictionaries:
Turing (programming language) — Turing is a Pascal like programming language developed in 1982 by Ric Holt and James Cordy, then of University of Toronto, Canada. Turing is a descendant of Euclid, Pascal and SP/k that features a clean syntax and precise machine independent… … Wikipedia
Programming language — lists Alphabetical Categorical Chronological Generational A programming language is an artificial language designed to communicate instructions to a machine, particularly a computer. Programming languages can be used to create programs that… … Wikipedia
Concurrent Euclid (programming language) — Concurrent Euclid (ConEuc) is a concurrent descendant of the Euclid programming language designed by James Cordy and Ric Holt, then at the University of Toronto, in 1980. ConEuc was designed for concurrent, high performance, highly reliable… … Wikipedia
APL (programming language) — APL Paradigm(s) array, functional, structured, modular Appeared in 1964 Designed by Kenneth E. Iverson Developer Kenneth E. Iverson … Wikipedia
Ada (programming language) — For other uses of Ada or ADA, see Ada (disambiguation). Ada Paradigm(s) Multi paradigm Appeared in 1980 Designed by MIL STD 1815/Ada 83: Jean Ichbiah Ada 95: Tucker Taft Ada 2005: Tucker Taft Stable release … Wikipedia
Turing machine — For the test of artificial intelligence, see Turing test. For the instrumental rock band, see Turing Machine (band). Turing machine(s) Machina Universal Turing machine Alternating Turing machine Quantum Turing machine Read only Turing machine… … Wikipedia
Turing-complet — Pour les articles homonymes, voir Turing (homonymie). L adjectif Turing complet[1] s applique en informatique et en logique à un système formel ou formalisable ayant la force de calcul des machines de Turing, c est à dire un système dans lequel… … Wikipédia en Français
List of programming languages by category — Programming language lists Alphabetical Categorical Chronological Generational This is a list of programming languages grouped by category. Some languages are listed in multiple categories. Contents … Wikipedia
List of programming languages — Programming language lists Alphabetical Categorical Chronological Generational The aim of this list of programming languages is to include all notable programming languages in existence, both those in current use and historical ones, in… … Wikipedia
Turing's proof — First published in January 1937 with the title On Computable Numbers, With an Application to the Entscheidungsproblem , Turing s proof was the second proof of the assertion (Alonzo Church proof was first) that some questions are undecidable :… … Wikipedia
