Rank and uniformity

Hui, Roger K. W.

doi:10.1145/206913.206968

Cited by 3 publications

(1 citation statement)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Such operations often are referred to as uniform operations [Hui95]. Uniformity enables a straight-forward approach to an effective utilisation of static shape information: Whenever a shape information is statically available it is propagated into all existing function calls by specialising these according to the given shapes.…”

Section: Introductionmentioning

confidence: 99%

A Binding Scope Analysis for Generic Programs on Arrays

Grelck

Scholz

Shafarenko

2006

Implementation and Application of Functional Languages

View full text Add to dashboard Cite

Abstract. Performance of generic array programs crucially relies on program specialisation wrt. shape information. Traditionally, this is done in a rather ad hoc fashion by propagating all shape information that is available. When striving for a compositional programming style that adheres to good software engineering principles this approach turns out to be insufficient. Instead, static value information needs to be propagated as well which introduces all the well known problems of partial evaluation in general.In this paper, we propose a static analysis that identifies to what extent specialisation needs to be employed in order to achieve a certain level of shape information. This narrows the scope of specialisation far enough to make specialisation for shape information feasible despite a compositional programming style. Some examples to this effect are presented.

show abstract

Section: Introductionmentioning

confidence: 99%