Simple scalar
Revision as of 23:37, 16 November 2019 by Miraheze>Adám Brudzewsky (Text replacement - "{{APL programming language}}" to "{{APL features}}")
In nested array theory, a simple scalar is an array encoding data from one of the language's fundamental data types such as a number or character. A simple scalar is defined to be a scalar whose only element is itself. All nested APLs specify that simple scalars float, that is, a scalar array containing only a simple scalar is identical to that simple scalar. Because of this property, all arrays which are both simple and scalar are simple scalars.
Simple scalars are the only arrays with depth 0. An array consisting only of simple scalars therefore has depth 1; such arrays are called simple.
| APL features [edit] | |
|---|---|
| Built-ins | Primitives (functions, operators) ∙ Quad name |
| Array model | Shape ∙ Rank ∙ Depth ∙ Bound ∙ Index (Indexing) ∙ Axis ∙ Ravel ∙ Ravel order ∙ Element ∙ Scalar ∙ Vector ∙ Matrix ∙ Simple scalar ∙ Simple array ∙ Nested array ∙ Cell ∙ Major cell ∙ Subarray ∙ Empty array ∙ Prototype |
| Data types | Number (Boolean, Complex number) ∙ Character (String) ∙ Box ∙ Namespace ∙ Function array |
| Concepts and paradigms | Conformability (Scalar extension, Leading axis agreement) ∙ Scalar function (Pervasion) ∙ Identity element ∙ Complex floor ∙ Array ordering (Total) ∙ Tacit programming (Function composition, Close composition) ∙ Glyph ∙ Leading axis theory ∙ Major cell search ∙ First-class function |
| Errors | LIMIT ERROR ∙ RANK ERROR ∙ SYNTAX ERROR ∙ DOMAIN ERROR ∙ LENGTH ERROR ∙ INDEX ERROR ∙ VALUE ERROR ∙ EVOLUTION ERROR |