Category:MUMPS: Difference between revisions
Content added Content deleted
(Untyped, procedural, cleanup) |
mNo edit summary |
||
Line 1: | Line 1: | ||
{{language |
|||
|untyped=yes}} |
|untyped=yes}} |
||
{{language programming paradigm|procedural}} |
{{language programming paradigm|procedural}} |
||
Line 8: | Line 8: | ||
<p>See http://71.174.62.16/Demo/AnnoStd for details about the language.</p> |
<p>See http://71.174.62.16/Demo/AnnoStd for details about the language.</p> |
||
<p>MUMPS has one data type (strings). A variable can be unsubscripted or not, and the subscripted variables form a |
|||
sparse n-tree. MUMPS doesn't have arrays, but you can create a tree that only has one level of branching. Similarly, while the language doesn't have lists, you can mimic lists by creating strings with a consistent character (or string) between each entry.</p> |
Revision as of 03:19, 15 June 2010
MUMPS
This programming language may be used to instruct a computer to perform a task.
Listed below are all of the tasks on Rosetta Code which have been solved using MUMPS.
This programming language may be used to instruct a computer to perform a task.
Typing: | Untyped |
---|---|
See Also: |
|
Visit the Google group comp.lang.mumps for discussions about this language.
Visit Wikipedia for a general description.
See http://71.174.62.16/Demo/AnnoStd for details about the language.
MUMPS has one data type (strings). A variable can be unsubscripted or not, and the subscripted variables form a sparse n-tree. MUMPS doesn't have arrays, but you can create a tree that only has one level of branching. Similarly, while the language doesn't have lists, you can mimic lists by creating strings with a consistent character (or string) between each entry.
Subcategories
This category has the following 3 subcategories, out of 3 total.
@
- MUMPS examples needing attention (empty)
- MUMPS Implementations (empty)
- MUMPS User (7 P)
Pages in category "MUMPS"
The following 109 pages are in this category, out of 109 total.