A programming language

Iverson, Kenneth E.

doi:10.1145/1460833.1460872

Cited by 444 publications

(108 citation statements)

References 0 publications

Supporting

Mentioning

100

Contrasting

Unclassified

Order By: Relevance

“…Thus it is intended to make a GUI available on the web, written in the Apl (Iverson 1962) interpreter AplX (Nabavi 2001(Nabavi -2011, capable of producing publication quality graphs in a number of formats including postscript, pdf, jpg and png, for the user to graph their data in bi-symmetric log form.…”

Section: The Bi-symmetric Log Transformationmentioning

confidence: 99%

A bi-symmetric log transformation for wide-range data

Webber¹

2012

Meas. Sci. Technol.

View full text Add to dashboard Cite

Abstract. The logarithmic transformation has long been used to present data that has both large and small components that are significant, such as neutron scattering data, or to present data that say covers a wide range of time-scales, such as NMR relaxation data. A more general transformation, that is applicable to many different disciplines, is offered here, that is particularly suitable for representing wide-range data that has both positive and negative (or zero) components. The proposed transform smoothly modifies the gradient of the transformation so that in the region near zero it remains finite. A single constant is provided to tune this behavior, so as to adjust the meaning of "region near zero". This modified logarithmic transformation can be both one-sided or symmetric, and thus can transform negative data to scaled negative data. It can be applied to both the X and Y data, when it becomes a bi-symmetric log transform.

show abstract

Section: The Bi-symmetric Log Transformationmentioning

confidence: 99%

A bi-symmetric log transformation for wide-range data

Webber¹

2012

Meas. Sci. Technol.

View full text Add to dashboard Cite

show abstract

“…Crush Meertens [99] generalized APL's 'reduce' [67] to a crush operation, ⊕ :: t a → a for binary operator (⊕) :: a → a → a with a unit, polytypically over the structure of a regular functor t . For example, + polytypically sums a collection of numbers.…”

Section: Functional Iterationmentioning

confidence: 99%

Datatype-Generic Programming

Gibbons

2007

Datatype-Generic Programming

View full text Add to dashboard Cite

Abstract. Generic programming aims to increase the flexibility of programming languages, by expanding the possibilities for parametrization -ideally, without also expanding the possibilities for uncaught errors. The term means different things to different people: parametric polymorphism, data abstraction, meta-programming, and so on. We use it to mean polytypism, that is, parametrization by the shape of data structures rather than their contents. To avoid confusion with other uses, we have coined the qualified term datatype-generic programming for this purpose. In these lecture notes, we expand on the definition of datatype-generic programming, and present some examples of datatypegeneric programs. We also explore the connection with design patterns in object-oriented programming; in particular, we argue that certain design patterns are just higher-order datatype-generic programs.

show abstract

“…The use of array assignments to represent communication has at least two advantages over the library-based, approach of MPI [GrES99]. First, thanks to APL [Iver62] and Fortran 90 we have at our disposal a wealth of powerful array operators that can serve to unify and simplify the many communication and collective operations of MPI. Second, making the operations part of the language enables compiler support that simplifies the notation and improves error detection.…”

Section: Introductionmentioning

confidence: 99%