Article

Free access

Update analysis and the efficient implementation of functional aggregates

Author:

FPCA '89: Proceedings of the fourth international conference on Functional programming languages and computer architecture

Pages 26 - 38

https://doi.org/10.1145/99370.99373

Published: 01 November 1989 Publication History

PDF eReader

References

[1]

S. Abramsky and C. Hankin. Abstract Interpretation of Declarative Languages. Ellis IIorwood, 1987.

Digital Library

Google Scholar

[2]

Arvind, R.S. Nikhil, and K.P. Keshav. I-structures: data structures for parallel computing. In Proceedings of the Workshop on Graph ReduciiorL, Los Alamos, New Mexico, February 1987.

Digital Library

Google Scholar

[3]

H. Barendregt and M. van Leeuwen. Functional Programming and the Language TALE. Technical Report, Mathematical Institute, Netherlands, 1985.

Google Scholar

[4]

A. Bloss. Path Analysis and ihe Optimization of Non-strict Functional Languages. PhD thesis, Yale University, Department of Computer Science, 1989. Available as Research Report YALEU/DCS/RR- 704.

Digital Library

Google Scholar

[5]

A. Bloss and P. Hudak. Path semantics. In Proc. Third Workshop on the Mathematical Foundations of Programming Language Semantics, ACM, Springer-Verlag LNCS 298, April 1987.

Digital Library

Google Scholar

[6]

A. Bloss, P. Hudak, and J. Young. An optirnising compiler for a modern functional language. The Computer Journal, 31(6):152-161, 1988.

Digital Library

Google Scholar

[7]

P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In 4th A CM Symposium on Principles of Programming Languages, pages 238-252, ACM, 1977.

Digital Library

Google Scholar

[8]

K. Gopinath. Copy elimination in single assignment languages. PhD thesis, Stanford University, 1988.

Digital Library

Google Scholar

[9]

K. Gopinath and J. Hennessy. Copy elimination in functional languages. In Proceedings of lhe 16th A CM Symposium on Principles of Programming Languages, January 1989.

Digital Library

Google Scholar

[10]

P. Hudak. ALFL Reference Manual and Programmer's Guide. Research Report YALEU}DCS/RR- 322, Second Edition, Yale University, October 1984.

Google Scholar

[11]

P. Hudak. Arrays, non-determinism, side-effects, and parallelism: a functional perspective. In Proceedings of the $anla F~ Graph Reduction Workshop, pages 312-327, Los Alamos National Laboratory/MCC, Springer-Verlag 279, October 1986.

Digital Library

Google Scholar

[12]

P. Hudak. A semantic model of reference counting and its abstraction (detailed summary). In Symposium On Lisp and Functional Programming, pages 351-363, ACM, August 1986.

Digital Library

Google Scholar

[13]

P. Hudak and Philip et al. Wadler. Report on the Functional Programming Language Haskcll: Draft Proposed Standard. Technical Report YALEU/DCS/RR666, Yale University, Department of Computer Science, December 1988.

Google Scholar

[14]

P. Hudak and J. Young. Collecting interpretations of expressions (without powerdomains). In Proceedings of the 15th A CM Symposium on Principles of Programming Languages, pages 107-118, January 1988.

Digital Library

Google Scholar

[15]

P. Hudak and J. Young. Higher-order strictness analysis for untyped lambda calculus. In 12th A CM Symposium on Principles of Programming Languages, pages 97-109, January 1986.

Digital Library

Google Scholar

[16]

T. Johnsson. Lambda lifting: transforming programs to recursive equations.

Google Scholar

[17]

R. Keller. FEL Programmer's Guide. Technical Report, University of Utah, April 1983.

Google Scholar

[18]

D. Kranz, R. Kelsey, J. Rees, P. Hudak, J. Philbin, and N. Adams. Orbit: an optimizing compiler for Scheme. In $iGPLAN '86 Symposium on Compiler Construction, pages 219-233, ACM, June 1986. Published as SIGPLAN Notices Vol. 21, No. 7, July 1986.

Digital Library

Google Scholar

[19]

R.S. Nikhil, K. Pingali, and Arvind. Id Nouveau. Computation Structures Group Memo 265, Massachusetts Institute of Technology, Laboratory for Computer Science, July 1986.

Google Scholar

[20]

J.T. O'Donnell. An architecture that efficiently updates associative aggregates in applicative programming language. In Functional Programming Languages and Computer Architecture, pages 164- 189, Springer-Verlag LNCS 201, September 1985.

Crossref

Google Scholar

[21]

D.A. Schmidt. Detecting global variables in denotational specifications. A CM Transactions on Programming Languages and Systems, 7(2):299-310, 1985.

Digital Library

Google Scholar

[22]

D.A. Schmidt. Detecting Stack-Based Environments in Denotational Definitions. Research Report TR-CS-86-3, Kansas State University, October 1986.

Google Scholar

[23]

P. Wadler. A new array operation. In Proceedings of the Santa Fe Graph Reduction Workshop, pages 328-335, Los Alamos National Laboratory/MCC, Springer-Verlag LNCS 279, October 1986.

Digital Library

Google Scholar

[24]

D. Wise. Matrix algebra and applicative programruing. In Proceedings of 1987 Functional Programming Languages and Computer Architecture Conference, pages 134-153, Springer Verlag LNCS 274, September 1987.

Digital Library

Google Scholar

[25]

J. Young. Theory and Practice of Semantics- Directed Compiling for Functional Programming Languages. PhD thesis, Yale University, Department of Computer Science, 1988.

Google Scholar

Cited By

View all

Kallwies HLeucker MScheffel TSchmitz MThoma DLee J(2022)Aggregate update problem for multi-clocked dataflow languagesProceedings of the 20th IEEE/ACM International Symposium on Code Generation and Optimization10.1109/CGO53902.2022.9741275(79-91)Online publication date: 2-Apr-2022
https://dl.acm.org/doi/10.1109/CGO53902.2022.9741275
Kumar ABlelloch GHarper R(2017)Parallel functional arraysACM SIGPLAN Notices10.1145/3093333.300986952:1(706-718)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1145/3093333.3009869
Kumar ABlelloch GHarper RCastagna GGordon A(2017)Parallel functional arraysProceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages10.1145/3009837.3009869(706-718)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1145/3009837.3009869
Show More Cited By

Index Terms

Update analysis and the efficient implementation of functional aggregates
1. Software and its engineering
  1. Software notations and tools
2. Theory of computation
  1. Semantics and reasoning
    1. Program semantics

Recommendations

The aggregate update problem in functional programming systems
POPL '85: Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages

We discuss the problem of efficiently implementing aggregates (contiguous data structures) such as arrays in functional programming systems. Simple changes to an aggregate conceptually involve making a new copy of the aggregate differing only in the ...
Efficient array update analysis of strict functional languages
New techniques for the analysis and implementation of functional programs

Comments

Information & Contributors

Information

Published In

FPCA '89: Proceedings of the fourth international conference on Functional programming languages and computer architecture

November 1989

395 pages

ISBN:0897913280

DOI:10.1145/99370

Chairman:
Joseph E. Stoy

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 November 1989

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

FPCA89

Sponsor:

SIGPLAN
IFIP WG 2.8
SIGARCH

FPCA89: The International Conference on Functional Programming Languages & Computer Architectures

September 11 - 13, 1989

Imperial College, London, United Kingdom

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

47
Total Citations
View Citations
380
Total Downloads

Downloads (Last 12 months)62
Downloads (Last 6 weeks)16

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Kallwies HLeucker MScheffel TSchmitz MThoma DLee J(2022)Aggregate update problem for multi-clocked dataflow languagesProceedings of the 20th IEEE/ACM International Symposium on Code Generation and Optimization10.1109/CGO53902.2022.9741275(79-91)Online publication date: 2-Apr-2022
https://dl.acm.org/doi/10.1109/CGO53902.2022.9741275
Kumar ABlelloch GHarper R(2017)Parallel functional arraysACM SIGPLAN Notices10.1145/3093333.300986952:1(706-718)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1145/3093333.3009869
Kumar ABlelloch GHarper RCastagna GGordon A(2017)Parallel functional arraysProceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages10.1145/3009837.3009869(706-718)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1145/3009837.3009869
Gulwani SLev-Ami TSagiv M(2009)A combination framework for tracking partition sizesACM SIGPLAN Notices10.1145/1594834.148091244:1(239-251)Online publication date: 21-Jan-2009
https://dl.acm.org/doi/10.1145/1594834.1480912
Hardekopf BLin C(2009)Semi-sparse flow-sensitive pointer analysisACM SIGPLAN Notices10.1145/1594834.148091144:1(226-238)Online publication date: 21-Jan-2009
https://dl.acm.org/doi/10.1145/1594834.1480911
Bronson NKozyrakis COlukotun K(2009)Feedback-directed barrier optimization in a strongly isolated STMACM SIGPLAN Notices10.1145/1594834.148090944:1(213-225)Online publication date: 21-Jan-2009
https://dl.acm.org/doi/10.1145/1594834.1480909
Tozawa ATatsubori MOnodera TMinamide Y(2009)Copy-on-write in the PHP languageACM SIGPLAN Notices10.1145/1594834.148090844:1(200-212)Online publication date: 21-Jan-2009
https://dl.acm.org/doi/10.1145/1594834.1480908
Tozawa ATatsubori MOnodera TMinamide YShao ZPierce B(2009)Copy-on-write in the PHP languageProceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/1480881.1480908(200-212)Online publication date: 21-Jan-2009
https://dl.acm.org/doi/10.1145/1480881.1480908
Abu-Mahmeed SMccosh CBudimlić ZKennedy KRavindran KHogan KAustin PRogers SKornerup J(2009)Scheduling Tasks to Maximize Usage of Aggregate Variables in PlaceProceedings of the 18th International Conference on Compiler Construction: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 200910.1007/978-3-642-00722-4_15(204-219)Online publication date: 27-Mar-2009
https://dl.acm.org/doi/10.1007/978-3-642-00722-4_15
O'Neill MBurton FHosking AAdl-Tabatabai A(2006)Smarter garbage collection with simplifiersProceedings of the 2006 workshop on Memory system performance and correctness10.1145/1178597.1178601(19-30)Online publication date: 22-Oct-2006
https://dl.acm.org/doi/10.1145/1178597.1178601
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

The aggregate update problem in functional programming systems

Efficient array update analysis of strict functional languages

New techniques for the analysis and implementation of functional programs

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

The aggregate update problem in functional programming systems

Efficient array update analysis of strict functional languages

New techniques for the analysis and implementation of functional programs

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations