Article

Free access

Retire Fortran? A debate rekindled

Author:

David CannAuthors Info & Claims

Supercomputing '91: Proceedings of the 1991 ACM/IEEE conference on Supercomputing

Pages 264 - 272

https://doi.org/10.1145/125826.125976

Published: 01 August 1991 Publication History

PDF eReader

References

[1]

Arvind and R. Nikhil. Executing a program on the MIT tagged-token dataflow architecture. IEEE Transactions on Compulers, 39(3):300- 318, March 1990.

Digital Library

Google Scholar

[2]

Jeffrey M. Barth. A practical interprocedural data-flow analysis algorithm. Communicalions of the A CM, 21(9):724-736, September 1978.

Digital Library

Google Scholar

[3]

A. Bloss. Update analysis and the efficient implementation of functional aggregates. In The ~th Inlernational Conference on Funclional Programming Languages and Compuler Architecture, pages 26-38, 1989.

Crossref

Google Scholar

[4]

J. Boyle and T. Harmer. A practical functional program for the CRAY X-MP. Technical Report MCS-P159-0690, Argonne National Laboratory, 1990.

Google Scholar

[5]

D. C. Cann. Compilation Techniques for High Performance Applicative Computation. PhD thesis, Colorado State University, Computer Science Department, Fort Collins, CO, 1989.

Digital Library

Google Scholar

[6]

J. Cann, E. York, J. Stewart, J. Vera, and R. Maccioni. Small zone gel chromatography of interacting systems" Theoretical and experimental evaluation of elution profiles for kinetically controlled macromolecule-ligand reactions. Analytical Biochemistry, (175), December 1988.

Google Scholar

[7]

P. Chang and G. Egan. An implementation of a barotropic numerical weather prediction model in the functional language SISAL. In Proceedings of the SIGPLAN 1990 Symposium on Principles and Practice of Parallel Programming, March 1990.

Digital Library

Google Scholar

[8]

W. P. Crowley, C. P. Henderson, and T. E. Rudy. The simple code. Technical Report UCID 17715, Lawrence Livermore National Laboratory, Livermore, CA, Februrary 1978.

Google Scholar

[9]

J. Feo, D. Cann, and R. Oldehoeft. A report on the Sisal language project. Journal of Parallel and Distributed Computing, 10:349-365, December 1990.

Digital Library

Google Scholar

[10]

K. Gopinath. Copy Elimination in Single Assignment Languages. PhD thesis, Computer Systems Laboratory, Stanford University, Stanford, CA, 1989.

Digital Library

Google Scholar

[11]

P. Hudak. Conception, evolution, and application of functional programming languages. A CM Computing Surveys, 21(3):359-411, September 1989.

Digital Library

Google Scholar

[12]

P. Hudak and A. Bloss. The aggregate update problem in functional programming systems. In Twelfth Annual A CM Conference of ~he Principles of Programming Languages, pages 300-313, January 1985.

Digital Library

Google Scholar

[13]

J. Hughes. Why functional programming matters. The Computer Journal, 32(2):98-107, April 1989.

Digital Library

Google Scholar

[14]

B. J. MacLennan. Functional Programming Practice and Theory. Addison-Wesley Publishing Company, Reading, Massachusetts, 1990.

Digital Library

Google Scholar

[15]

J. R. McGraw, D. J. Kuck, and M. Wolfe. A debate: Retire Fortran? Physics Today, 37(5):66- 75, May 1984.

Crossref

Google Scholar

[16]

J. R. McGraw, S. K. Skedzielewski, S. J. Allan, R. R. Oldehoeft, J. Glauert, C. Kirkham, W. Noyce, and R. Thomas. SISAL: Streams and iteration in a single assignment language: Reference manual version 1.2. Manual M-146, Rev. I, Lawrence Livermore National Laboratory, Livermore, CA, March 1985.

Google Scholar

[17]

R. R. Oldehoeft, D. C. Cann, A. P. W. BShm, J. T. Feo, and D. H. Grit. SISAL reference manual language version 2.0. Technical Report UCRL-JC-104008, Lawrence Livermore National Laboratory, Livermore, CA, December 1988.

Google Scholar

[18]

J. E. Ranelletti. Graph Transformation Algorithms for Array Memory Optimization in Applicative Languages. PhD thesis, University of California at Davis, Computer Science Department, Davis, California, 1987.

Digital Library

Google Scholar

[19]

S. K. Skedzielewski and R. J. Simpson. A simple method to remove reference counting in applicative programs. In Proceedings of CONPAR 88, September 1988.

Google Scholar

[20]

M. Wolfe. Optimizing Supereompilers for Supercomputers. MIT Press, Cambridge, Massachusetts, 1989.

Digital Library

Google Scholar

Cited By

View all

Diavastos ATrancoso P(2017)SWITCHESACM Transactions on Architecture and Code Optimization10.1145/312706814:3(1-23)Online publication date: 6-Sep-2017
https://dl.acm.org/doi/10.1145/3127068
Orchard DRice AMurphy-Hill ESchaefer M(2013)Upgrading fortran source code using automatic refactoringProceedings of the 2013 ACM workshop on Workshop on refactoring tools10.1145/2541348.2541356(29-32)Online publication date: 27-Oct-2013
https://dl.acm.org/doi/10.1145/2541348.2541356
Moskovsky ARoganov VAbramov SKuznetsov A(2007)Variable reassignment in the T++ parallel programming languageProceedings of the 9th international conference on Parallel Computing Technologies10.5555/2392094.2392157(579-588)Online publication date: 3-Sep-2007
https://dl.acm.org/doi/10.5555/2392094.2392157
Show More Cited By

Index Terms

Recommendations

Retire Fortran?: a debate rekindled
The uniqueness debate in computer ethics: What exactly is at issue, and why does it matter?

The purpose of this essay is to determine what exactly is meant by the claim computer ethics is unique, a position that will henceforth be referred to as the CEIU thesis. A brief sketch of the CEIU debate is provided, and an empirical case involving a recent ...
Debate: what is personhood in the age of AI?
Abstract
In a friendly interdisciplinary debate, we interrogate from several vantage points the question of “personhood” in light of contemporary and near-future forms of social AI. David J. Gunkel approaches the matter from a philosophical and legal ...

Comments

Information & Contributors

Information

Published In

Supercomputing '91: Proceedings of the 1991 ACM/IEEE conference on Supercomputing

August 1991

920 pages

ISBN:0897914597

DOI:10.1145/125826

Conference Chair:
Ray Elliott

Permission to make digital or hard copies of all or part 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 components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1991

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SC '91

Sponsor:

SIGARCH
IEEE-CS

SC '91: International Conference for High Performance Computing, Networking, Storage and Analysis

November 18 - 22, 1991

New Mexico, Albuquerque, USA

Acceptance Rates

Supercomputing '91 Paper Acceptance Rate 83 of 215 submissions, 39%;

Overall Acceptance Rate 1,516 of 6,373 submissions, 24%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
357
Total Downloads

Downloads (Last 12 months)38
Downloads (Last 6 weeks)12

Reflects downloads up to 17 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Diavastos ATrancoso P(2017)SWITCHESACM Transactions on Architecture and Code Optimization10.1145/312706814:3(1-23)Online publication date: 6-Sep-2017
https://dl.acm.org/doi/10.1145/3127068
Orchard DRice AMurphy-Hill ESchaefer M(2013)Upgrading fortran source code using automatic refactoringProceedings of the 2013 ACM workshop on Workshop on refactoring tools10.1145/2541348.2541356(29-32)Online publication date: 27-Oct-2013
https://dl.acm.org/doi/10.1145/2541348.2541356
Moskovsky ARoganov VAbramov SKuznetsov A(2007)Variable reassignment in the T++ parallel programming languageProceedings of the 9th international conference on Parallel Computing Technologies10.5555/2392094.2392157(579-588)Online publication date: 3-Sep-2007
https://dl.acm.org/doi/10.5555/2392094.2392157
Moskovsky ARoganov VAbramov SKuznetsov A(2007)Variable Reassignment in the T++ Parallel Programming LanguageParallel Computing Technologies10.1007/978-3-540-73940-1_58(579-588)Online publication date: 2007
https://doi.org/10.1007/978-3-540-73940-1_58
Abramson DMcKay A(1995)Evaluating the performance of a SISAL implementation of the Abingdon Cross image processing benchmarkInternational Journal of Parallel Programming10.1007/BF0257778623:2(105-134)Online publication date: 1-Apr-1995
https://dl.acm.org/doi/10.1007/BF02577786
Raiche A(1994)Modelling and inversion -progress, problems, and challengesSurveys in Geophysics10.1007/BF0068985915:2(159-207)Online publication date: Mar-1994
https://doi.org/10.1007/BF00689859
Willhoft R(1993)Structured APLACM SIGAPL APL Quote Quad10.1145/166198.16623524:1(304-315)Online publication date: 1-Sep-1993
https://dl.acm.org/doi/10.1145/166198.166235
Willhoft R(1993)Structured APLProceedings of the international conference on APL10.1145/166197.166235(304-315)Online publication date: 1-Sep-1993
https://dl.acm.org/doi/10.1145/166197.166235
Oldehoeft R(1992)Multithreaded computer systemsProceedings of the 1992 ACM/IEEE conference on Supercomputing10.5555/147877.148129(772-775)Online publication date: 1-Dec-1992
https://dl.acm.org/doi/10.5555/147877.148129
Papadopoulos GBohm ADahbura AOldehoeft R(1992)Multithreaded computer systemsProceedings Supercomputing '9210.1109/SUPERC.1992.236686(772-775)Online publication date: 1992
https://doi.org/10.1109/SUPERC.1992.236686
Show More Cited By

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