DSSP (programming)

It is proposed that this article be deleted because of the following concern:

Fails WP:N, per expert review, cf. talk page

If you can address this concern by improving, copyediting, sourcing, renaming, or merging the page, please edit this page and do so. You may remove this message if you improve the article or otherwise object to deletion for any reason. Although not required, you are encouraged to explain why you object to the deletion, either in your edit summary or on the talk page. If this template is removed, do not replace it.

This message has remained in place for seven days, so the article may be deleted without further notice.

If you created the article, please don't be offended. Instead, consider improving the article so that it is acceptable according to the deletion policy.
Find sources: "DSSP" programming – news · newspapers · books · scholar · JSTOR

Nominator: Please consider notifying the author/project: {{subst:proposed deletion notify|DSSP (programming)|concern=Fails [[WP:N]], per expert review, cf. talk page}} ~~~~
Timestamp: 20070714180057 18:00, 14 July 2007 (UTC)
Administrators: delete

The topic of this article may not meet Wikipedia's general notability guideline. Please help to demonstrate the notability of the topic by citing reliable secondary sources that are independent of the topic and provide significant coverage of it beyond a mere trivial mention. If notability cannot be shown, the article is likely to be merged, redirected, or deleted.
Find sources: "DSSP" programming – news · newspapers · books · scholar · JSTOR (October 2006) (Learn how and when to remove this message)

DSSP (Dialog System for Structured Programming) is a programming language. It was created by students in the laboratory of Brousentsov N. P. at the Computer Science department of the Moscow State University in 1980. The 32-bit version was created in 1989.

DSSP is similar to the Forth programming language; both are examples of stack-based languages. It may be seen as an early fork from Forth, yet with roots extending to the ternary logic computers called Setun built by Brousentsov in the late 1950s and early 1960s.

Relying on the principle of "one word of text - one word of machine code", DSSP stays very close to the actual machine in structure. It uses Reverse Polish Notation, which is a stack-oriented form of calculating.

The first document in English regarding this obscure language distinguishes DSSP from Forth in the following manner: "DSSP was not invented. It was found. That is why DSSP has not versions, but only extensions. Forth is created by practice. DSSP is created by theory."

External links