Article

Free access

Tentative compilation: A design for an APL compiler

Author:

Terrence C. MillerAuthors Info & Claims

APL '79: Proceedings of the international conference on APL: part 1

Pages 88 - 95

https://doi.org/10.1145/800136.804443

Published: 30 May 1979 Publication History

PDF eReader

Abstract

The overall design of an APL compiler which achieves significant savings of temporary storage is outlined. A graphical intermediate representation for APL expressions is described. Transformations which may be applied to this intermediate representation to select improved array access orders are presented with examples of the storage savings obtained.

References

[1]

Abrams, P. S., "An APL Machine" Stanford University Computer Science Dept., Report STAN-CS-70-158 (1970).

Google Scholar

[2]

Bauer, A.M., Saal, H. J., "Does APL Really Need Run-time Checking", Software-Practice and Experience, 4()129-138, (1974).

Google Scholar

[3]

Guibas, L. J., Wyatt, D. K., "Compilation and Delayed Evaluation in APL", Fifth POPL, ACM (1978).

Digital Library

Google Scholar

[4]

Hassitt, A., Lyon, L. E., "Efficient Evaluation of Array Subscripts of Arrays", IBM Journal of Research and Development, January 1972.

Google Scholar

[5]

Kaplan, M. A. and J. D. Ullman, "A General Scheme for the Automatic Inference of Variable Types", Fifth ACM Symposium on Principles of Programming Languages, 1978.

Digital Library

Google Scholar

[6]

McDonnell, E. E., "The Caret Functions: Efficient Algorithms for the Scans and Reductions of Eight Boolean Functions", Proceedings of the Sixth International APL Users Conference, Anaheim CA (1974).

Digital Library

Google Scholar

[7]

Miller, T. C., "Tentative Compilation: A Design for an APL Compiler", Ph.D thesis, Dept. of Computer Science, Yale University, 1978.

Digital Library

Google Scholar

[8]

Miller, T. C. "Type Checking in an Imperfect World", Sixth POPL, ACM (1979).

Digital Library

Google Scholar

[9]

Minter, C. R., "A Machine Design for Efficient Implementation of APL", Dept. of Computer Science, Yale University, Research Report #81 (1976).

Google Scholar

[10]

Perlis, A. J., "Steps Toward an APL Compiler - Updated", Dept. of Computer Science, Yale University, Research Report #24 (1975).

Google Scholar

Cited By

View all

(2012)BibliographyEngineering a Compiler10.1016/B978-0-12-088478-0.00024-4(765-785)Online publication date: 2012
https://doi.org/10.1016/B978-0-12-088478-0.00024-4
Mullin L(2005)A uniform way of reasoning about array-based computation in radarDigital Signal Processing10.1016/j.dsp.2005.02.00315:5(466-520)Online publication date: 1-Sep-2005
https://dl.acm.org/doi/10.1016/j.dsp.2005.02.003
Raynolds JMullin L(2005)Applications of Conformal Computing techniques to problems in computational physics: the Fast Fourier TransformComputer Physics Communications10.1016/j.cpc.2005.02.004170:1(1-10)Online publication date: Jul-2005
https://doi.org/10.1016/j.cpc.2005.02.004
Show More Cited By

Index Terms

Tentative compilation: A design for an APL compiler
1. Software and its engineering
  1. Software notations and tools
    1. Compilers
    2. General programming languages
      1. Language features
        Procedures, functions and subroutines
      2. Language types

Recommendations

Tentative compilation: A design for an APL compiler
Part 1

The overall design of an APL compiler which achieves significant savings of temporary storage is outlined. A graphical intermediate representation for APL expressions is described. Transformations which may be applied to this intermediate representation ...
Meta-compilation of language abstractions
An abstract intermediate representation in compilation systems

The design of an intermediate representation is critical to the portability of a compiler and the efficiency of code generation. In order to increase the reusability of compiler components, and to simplify the development process of compilers, the paper ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

APL '79: Proceedings of the international conference on APL: part 1

May 1979

403 pages

ISBN:9781450374408

DOI:10.1145/800136

Chairman:
Paul Penfield

ACM SIGAPL APL Quote Quad Volume 9, Issue 4-P1
Part 1
June 1979
403 pages
ISSN:0163-6006
DOI:10.1145/390009
Chair:
Philip S. Abrams
Scientific Time Sharing Corp., Bethesda, MD
Issue’s Table of Contents

Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 30 May 1979

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
363
Total Downloads

Downloads (Last 12 months)84
Downloads (Last 6 weeks)9

Reflects downloads up to 14 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

(2012)BibliographyEngineering a Compiler10.1016/B978-0-12-088478-0.00024-4(765-785)Online publication date: 2012
https://doi.org/10.1016/B978-0-12-088478-0.00024-4
Mullin L(2005)A uniform way of reasoning about array-based computation in radarDigital Signal Processing10.1016/j.dsp.2005.02.00315:5(466-520)Online publication date: 1-Sep-2005
https://dl.acm.org/doi/10.1016/j.dsp.2005.02.003
Raynolds JMullin L(2005)Applications of Conformal Computing techniques to problems in computational physics: the Fast Fourier TransformComputer Physics Communications10.1016/j.cpc.2005.02.004170:1(1-10)Online publication date: Jul-2005
https://doi.org/10.1016/j.cpc.2005.02.004
Aycock J(2003)A brief history of just-in-timeACM Computing Surveys10.1145/857076.85707735:2(97-113)Online publication date: 1-Jun-2003
https://dl.acm.org/doi/10.1145/857076.857077
Skutt C(1991)Alternative Evaluation of Array ExpressionsArrays, Functional Languages, and Parallel Systems10.1007/978-1-4615-4002-1_15(269-294)Online publication date: 1991
https://doi.org/10.1007/978-1-4615-4002-1_15
Mullin L(1991)Psi, the Indexing Function: a basis for FFP with arraysArrays, Functional Languages, and Parallel Systems10.1007/978-1-4615-4002-1_12(185-200)Online publication date: 1991
https://doi.org/10.1007/978-1-4615-4002-1_12
Koster A(1986)Compiling APL for parallel execution on an FFP machineProceedings of the international conference on APL: APL and the future10.1145/17701.255327(29-37)Online publication date: 1-Jun-1986
https://dl.acm.org/doi/10.1145/17701.255327
Koster A(1985)Compiling APL for parallel execution on an FFP machineACM SIGAPL APL Quote Quad10.1145/255315.25532715:4(29-37)Online publication date: 12-May-1985
https://dl.acm.org/doi/10.1145/255315.255327
Condry MWhite JLipton RGoldberg P(1981)Paging as a "language processing" taskProceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/567532.567538(63-76)Online publication date: 26-Jan-1981
https://dl.acm.org/doi/10.1145/567532.567538

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Tentative compilation: A design for an APL compiler

Meta-compilation of language abstractions

An abstract intermediate representation in compilation systems