Dataflow analysis in APL

Authors:
Timothy A. Budd
Affiliations:
Department of Computer Science, The University of Arizona, Tucson, Arizona
Venue:
APL '85 Proceedings of the international conference on APL: APL and the future
Year:
1985

Citing 8
Cited 4

An APL Compiler for a Vector Processor

ACM Transactions on Programming Languages and Systems (TOPLAS)
Type checking in an imperfect world

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Program Flow Analysis: Theory and Application

Program Flow Analysis: Theory and Application
An APL compiler for the UNIX timesharing system

APL '83 Proceedings of the international conference on APL
Programming with idioms in APL

APL '79 Proceedings of the international conference on APL: part 1
Steps toward an APL compiler

APL '79 Proceedings of the international conference on APL: part 1
Compile time syntax analysis of APL programs

APL '81 Proceedings of the international conference on APL
Type determination in an optimizing compiler for apl.

Type determination in an optimizing compiler for apl.

Program analysis and code generation in an APL/370 compiler

IBM Journal of Research and Development
APL as a prototyping language: case study of a compiler development project

APL '86 Proceedings of the international conference on APL
Parallel expression in the APL2 language

IBM Systems Journal
Array morphology

APL '93 Proceedings of the international conference on APL

Quantified Score

Hi-index	0.00

Visualization

Abstract

An algorithm is described to perform dataflow analysis on programs written in an APL-like language. The dataflow analysis is performed at both the intra and interprocedural levels. The algorithm presented here is simpler and tailored more directly to the target language than previously published algorithms for dataflow analysis in APL. These algorithms have been implemented as part of a APL compiler.