Article

Free access

Analysis and caching of dependencies

Authors:

Butler Lampson,

Jean-Jacques LévyAuthors Info & Claims

ICFP '96: Proceedings of the first ACM SIGPLAN international conference on Functional programming

Pages 83 - 91

https://doi.org/10.1145/232627.232638

Published: 15 June 1996 Publication History

Abstract

We address the problem of dependency analysis and caching in the context of the λ-calculus. The dependencies of a λ-term are (roughly) the parts of the λ-term that contribute to the result of evaluating it. We introduce a mechanism for keeping track of dependencies, and discuss how to use these dependencies in caching.

References

[1]

M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. L~vy. Explicit substitutions. Journal of Functional Programming, 1(4):375-416, 1991.

[2]

Henk P. Barendregt. The Lambda Calculus. North Holland, Revised edition, 1984.

[3]

G. Berry. Stable models of typed lambda-caJculi. In Proc. 5th Coll. on Automata, Languages and Programming, Lectures Notes in Computer Science, pages 72-89. Springer-Verlag, 1978.

Digital Library

[4]

G.L. Burn, C. Hankin, and S. Abramsky. Strictness analysis for higher-order functions. Science of Computer Programming, 7:249-278, 1986.

Digital Library

[5]

John Field. On laziness and optimality in lambda interpreters: Tools for specification and analysis. In Proceedings of the Seventeenth Annual ACM Symposium on Principles of Programming Languages, pages 1-15, 1990.

Digital Library

[6]

John Field and Tim Teitelbaum. Incremental reduction in the lambda calculus. In Proceedings of the 1990 A CM Conference on LISP and Functional Programming, pages 307-322. ACM, 1990.

Digital Library

[7]

Georges Gonthier, Jean-Jacques L~vy, and Pauk Andr~ Melli~s. An abstract standardisation theorem. In Seventh Annual IEEE Symposium on Logic in Computer Science, 19~2.

[8]

Milind Gandhe, G. Venkatesh, and Amitabha SanyaJ. Labeled A-calculus and a generalised notion of strictness. In A szan Computing Science Conference, Lecture Notes in Computer Science. Springer-Verlag, December 1995.

Digital Library

[9]

G~rard Huet and Jean-Jacques L~vy. Computations in Orthogonal Term Rewriting Systems. MiT Press, 1991.

[10]

Chris Hanna and Roy Levin. The Vesta language for configuration management. Research Report 107, Digital Equipment Corporation, Systems Research Center, June 1993. Available from http: / / www. research, digital, corn / SRC.

[11]

John Hughes. Lazy memo-functions. In Jean- Pierre Joua~naud, editor, Functional Programm~ng Languages and Computer Architecture, pages 129-146, September 1985.

Digital Library

[12]

Jan Willem Klop. Combinatory Reduction Systems. PhD thesis, CWI, 1980.

[13]

Jean-Jacques L~vy. Reductions Correctes et Optimales dans le Lambda Calcul. PhD thesis, University of Paris 7, 1978.

[14]

Roy Levin and Paul R. McJones. The Vesta approach to precise configuration of large software systems. Research Report 105, Digital Equipment Corporation, Systems Research Center, June 1993. Available from http: //www. research, digital, corn / SRC.

[15]

Luc Maranget. Optimal derivations in weak lambda-calculi and in orthogonal term rewriting systems. In Proceedings of the Eighteenth Annual A CM Symposium on Principle.~: of Programming Languages, 1991.

Digital Library

[16]

D. Michie. 'Memo' functions and machine learning. Nature, 218:19-22, 1968.

[17]

Michael O'Donnell. Computing in Systems described by Equations. PhD thesis, Cornell University, 1977.

[18]

William Pugh. Incremental Corr~putation and the Incremental Evaluation of Functional Programs. PhD thesis, Cornell University, 1988.

Digital Library

Cited By

Pacak ASzabó TErdweg SScholz BKameyama Y(2022)Incremental Processing of Structured Data in DatalogProceedings of the 21st ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences10.1145/3564719.3568686(20-32)Online publication date: 29-Nov-2022
https://dl.acm.org/doi/10.1145/3564719.3568686
Stein BChang BSridharan MFreund SYahav E(2021)Demanded abstract interpretationProceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation10.1145/3453483.3454044(282-295)Online publication date: 19-Jun-2021
https://dl.acm.org/doi/10.1145/3453483.3454044
de Souza CMachado LMelo R(2020)On Moderating Software Crowdsourcing ChallengesProceedings of the ACM on Human-Computer Interaction10.1145/33751944:GROUP(1-22)Online publication date: 4-Jan-2020
https://dl.acm.org/doi/10.1145/3375194
Show More Cited By

Index Terms

Analysis and caching of dependencies

Recommendations

Analysis and caching of dependencies

We address the problem of dependency analysis and caching in the context of the λ-calculus. The dependencies of a λ-term are (roughly) the parts of the λ-term that contribute to the result of evaluating it. We introduce a mechanism ...
Selective Victim Caching: A Method to Improve the Performance of Direct-Mapped Caches

Although direct-mapped caches suffer from higher miss ratios as compared to set-associative caches, they are attractive for today's high-speed pipelined processors that require very low access times. Victim caching was proposed by Jouppi [1] as an ...
Extending dependencies with conditions
VLDB '07: Proceedings of the 33rd international conference on Very large data bases

This paper introduces a class of conditional inclusion dependencies (CINDs), which extends traditional inclusion dependencies (INDs) by enforcing bindings of semantically related data values. We show that CINDs are useful not only in data cleaning, but ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ICFP '96: Proceedings of the first ACM SIGPLAN international conference on Functional programming

June 1996

273 pages

ISBN:0897917707

DOI:10.1145/232627

Chairman:
Robert Harper
Carnegie Mellon Univ., Pittsburgh, PA
,
Editor:
Richard L. Wexelblat

ACM SIGPLAN Notices Volume 31, Issue 6
June 15, 1996
273 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/232629
Chairmen:
Robert Harper
Carnegie Mellon Univ., Pittsburgh, PA
,
Richard L. Wexelblat
Issue’s Table of Contents

Copyright © 1996 ACM.

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]

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 15 June 1996

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

ICFP96

Sponsor:

SIGPLAN

ICFP96: International Conference on Functional Programming

May 24 - 26, 1996

Pennsylvania, Philadelphia, USA

Acceptance Rates

ICFP '96 Paper Acceptance Rate 25 of 83 submissions, 30%;

Overall Acceptance Rate 333 of 1,064 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

123
Total Citations
View Citations
527
Total Downloads

Downloads (Last 12 months)71
Downloads (Last 6 weeks)13

Reflects downloads up to 13 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Pacak ASzabó TErdweg SScholz BKameyama Y(2022)Incremental Processing of Structured Data in DatalogProceedings of the 21st ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences10.1145/3564719.3568686(20-32)Online publication date: 29-Nov-2022
https://dl.acm.org/doi/10.1145/3564719.3568686
Stein BChang BSridharan MFreund SYahav E(2021)Demanded abstract interpretationProceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation10.1145/3453483.3454044(282-295)Online publication date: 19-Jun-2021
https://dl.acm.org/doi/10.1145/3453483.3454044
de Souza CMachado LMelo R(2020)On Moderating Software Crowdsourcing ChallengesProceedings of the ACM on Human-Computer Interaction10.1145/33751944:GROUP(1-22)Online publication date: 4-Jan-2020
https://dl.acm.org/doi/10.1145/3375194
Niu SMcCrickard DNguyen JHaqq DKotut LStelter TFox E(2020)Investigating Paradigms of Group Territory in Multiple Display EnvironmentsProceedings of the ACM on Human-Computer Interaction10.1145/33751934:GROUP(1-28)Online publication date: 4-Jan-2020
https://dl.acm.org/doi/10.1145/3375193
Dijkhuizen NHam J(2018)A Survey of Network Traffic Anonymisation Techniques and ImplementationsACM Computing Surveys10.1145/318266051:3(1-27)Online publication date: 23-May-2018
https://dl.acm.org/doi/10.1145/3182660
Augustsson LÅgren M(2016)Experience report: types for a relational algebra libraryACM SIGPLAN Notices10.1145/3241625.297601651:12(127-132)Online publication date: 8-Sep-2016
https://dl.acm.org/doi/10.1145/3241625.2976016
Ekblad A(2016)High-performance client-side web applications through Haskell EDSLsACM SIGPLAN Notices10.1145/3241625.297601551:12(62-73)Online publication date: 8-Sep-2016
https://dl.acm.org/doi/10.1145/3241625.2976015
Dexter PLiu YChiu K(2016)Lazy graph processing in HaskellACM SIGPLAN Notices10.1145/3241625.297601451:12(182-192)Online publication date: 8-Sep-2016
https://dl.acm.org/doi/10.1145/3241625.2976014
Pickering MÉrdi GPeyton Jones SEisenberg R(2016)Pattern synonymsACM SIGPLAN Notices10.1145/3241625.297601351:12(80-91)Online publication date: 8-Sep-2016
https://dl.acm.org/doi/10.1145/3241625.2976013
Gibbons J(2016)Free delivery (functional pearl)ACM SIGPLAN Notices10.1145/3241625.297600551:12(45-50)Online publication date: 8-Sep-2016
https://dl.acm.org/doi/10.1145/3241625.2976005
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

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

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents