Data-structured language

A Data-structured language is a programming language in which the Data Data structure is a main organizing principle, Knowledge representation, model, for data and logic (Code (computer programming)) alike, in which both are stored and operated upon, i.e., program data and logic are structured and operated on in the same way.

Data-structured languages are generally more consistent in some ways, than many other languages. This makes them easier to learn, and to program in for the set of problems which naturally fits, Map (mathematics) to, a language s data structure. Where this occurs, some types of programming, or programming some types of problems, becomes trivial. For the set of problems which do not naturally fit a language s data structure, programming may be no easier than in other languages. For the set of problems which naturally conflict with a language s data structure, programming may be be harder than in other languages.

Data-structured languages are generally well suited to Reflection (computer science) and introspection.

In Computer program written in some data-structured languages, when there occurs an instance of the type of data representation which forms the basis of the language, then such instance is treated as a special case of quoted program.

=Variants=

Three main classes of data-structured languages exist, determined by the type of data structure on which they are based.

Array-based *APL programming language *J programming language

List-based *Joy programming language *Lisp programming language **Paul_Graham **Common Lisp **Dylan programming language **Emacs Lisp **Interlisp **Logo programming language **Scheme programming language **ZetaLisp *Tcl *TRAC programming language

Stack data structure-based (open stacks) *Forth programming language *Poplog *PostScript

Some languages can statically link data inline with instructions. These can be considered data-structured, in the most primitive way. Some Assembly languages can do this.