Category:MUMPS

From Rosetta Code
Language
MUMPS
This programming language may be used to instruct a computer to perform a task.
Typing: Untyped
See Also:


Listed below are all of the tasks on Rosetta Code which have been solved using MUMPS.
Your Help Needed
If you know MUMPS, please write code for some of the tasks not implemented in MUMPS.


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.

Standard MUMPS has one data types (strings) and some dialects (Cache, MSM) add a second data type (objects). A variable can be unsubscripted or not, and the subscripted variables form a sparse n-tree. MUMPS doesn't have traditional arrays, but has an array syntax that manipulates trees as if they were arrays, using indexing to access nodes of the tree. You can create a tree that can have unlimited levels of branching, with keys and values associated with each node in the tree. Similarly, while the language doesn't have lists, you can mimic lists by creating strings with a consistent character (or string) as a delimiter separating the entries. The Cache dialect also supports explicit List operations and data structures.

Subcategories

This category has the following 3 subcategories, out of 3 total.

Pages in category "MUMPS"

The following 102 pages are in this category, out of 102 total.