Article

Free access

A lazy evaluator

Authors:

Peter Henderson,

James H. Morris, Jr.Authors Info & Claims

POPL '76: Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages

Pages 95 - 103

https://doi.org/10.1145/800168.811543

Published: 01 January 1976 Publication History

PDF eReader

Abstract

A different way to execute pure LISP programs is presented. It delays the evaluation of parameters and list structures without ever having to perform more evaluation steps than the usual method. Although the central idea can be found in earlier work this paper is of interest since it treats a rather well-known language and works out an algorithm which avoids full substitution. A partial correctness proof using Scott-Strachey semantics is sketched in a later section.

References

[1]

Curry, H.B. and Feys, R., Combinatory Logic, vol 1. North-Holland, 1958.

Google Scholar

[2]

Hewitt, Carl, et. al., Behavioral semantics of non-recursive control structures, Proceedings, Colloque sur la Programmation, Springer-Verlag Lecture Notes in Computer Science, No. 19, 1974.

Digital Library

Google Scholar

[3]

Reynolds, J. R., Notes on a lattice-theoretic approach to the theory of computation, Lecture notes, Syracuse University, 1971.

Google Scholar

[4]

Scott, D. and Strachey, C., Toward a mathematical semantics for computer languages, Proc. of the Symposium on Computers and Automata, Polytechnic Institute of Brooklyn, and PRG-6 Oxford University Computing Laboratory, 1971.

Google Scholar

[5]

Stoy, J., The Scott-Strachey approach to the mathematical semantics of programming languages, Course notes at M.I.T. Project MAC, 1973.

Google Scholar

[6]

Vuillemin, J., Correct and optimal implementations of recursion in a simple programming language, Journal of Computer and System Sciences, vol. 9, No. 3, December 1974.

Digital Library

Google Scholar

[7]

Wadsworth, Christopher, Semantics and Pragmatics of the Lambda-calculus, PhD. thesis, Oxford, 1971.

Google Scholar

Cited By

View all

Wang ZPailoor SPrakash AWang YDillig I(2024)From Batch to Stream: Automatic Generation of Online AlgorithmsProceedings of the ACM on Programming Languages10.1145/36564188:PLDI(1014-1039)Online publication date: 20-Jun-2024
https://dl.acm.org/doi/10.1145/3656418
Yun ZIskander M(2024)Two-System Real-Time Radio Propagation Modeling2024 IEEE International Symposium on Antennas and Propagation and INC/USNC‐URSI Radio Science Meeting (AP-S/INC-USNC-URSI)10.1109/AP-S/INC-USNC-URSI52054.2024.10687081(1631-1632)Online publication date: 14-Jul-2024
https://doi.org/10.1109/AP-S/INC-USNC-URSI52054.2024.10687081
Keiser JLemire D(2024)On‐demand JSON: A better way to parse documents?Software: Practice and Experience10.1002/spe.331354:6(1074-1086)Online publication date: 18-Jan-2024
https://doi.org/10.1002/spe.3313
Show More Cited By

Index Terms

A lazy evaluator
1. Mathematics of computing
  1. Continuous mathematics
    1. Calculus
      1. Lambda calculus
  2. Mathematical analysis
    1. Calculus
      1. Lambda calculus
2. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language types

Recommendations

A self-applicable online partial evaluator for recursive flowchart languages

This paper describes a self-applicable online partial evaluator for a flowchart language with recursive calls. Self-application of the partial evaluator yields generating extensions that are as efficient as those reported in the literature for offline ...
O, partial evaluator, where art thou?
PEPM '10: Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation

Partial evaluation is now a quite old idea, and it has been implemented many times. Partial evaluation is also very widely applicable; almost every problem in computing could use it. But widely used partial evaluators are nowhere to be seen. Why is that?...
Distributed Lazy Evaluation: A Big-Step Mechanised Semantics
PDP '14: Proceedings of the 2014 22nd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing

This paper presents a big-step operational semantics for distributed lazy evaluation. Our semantics is an extension to the famous heap-based semantics of Launchbury for lazy evaluation. The high level of abstraction in our semantics helps us to easily ...

Comments

Information & Contributors

Information

Published In

POPL '76: Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages

January 1976

224 pages

ISBN:9781450374774

DOI:10.1145/800168

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 January 1976

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

POPL '76 Paper Acceptance Rate 20 of 90 submissions, 22%;

Overall Acceptance Rate 824 of 4,130 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

229
Total Citations
View Citations
1,280
Total Downloads

Downloads (Last 12 months)259
Downloads (Last 6 weeks)129

Reflects downloads up to 15 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Wang ZPailoor SPrakash AWang YDillig I(2024)From Batch to Stream: Automatic Generation of Online AlgorithmsProceedings of the ACM on Programming Languages10.1145/36564188:PLDI(1014-1039)Online publication date: 20-Jun-2024
https://dl.acm.org/doi/10.1145/3656418
Yun ZIskander M(2024)Two-System Real-Time Radio Propagation Modeling2024 IEEE International Symposium on Antennas and Propagation and INC/USNC‐URSI Radio Science Meeting (AP-S/INC-USNC-URSI)10.1109/AP-S/INC-USNC-URSI52054.2024.10687081(1631-1632)Online publication date: 14-Jul-2024
https://doi.org/10.1109/AP-S/INC-USNC-URSI52054.2024.10687081
Keiser JLemire D(2024)On‐demand JSON: A better way to parse documents?Software: Practice and Experience10.1002/spe.331354:6(1074-1086)Online publication date: 18-Jan-2024
https://doi.org/10.1002/spe.3313
Grybniak SNashyvan OMazurok ILeonchyk YVorokhta A(2023)EVM-Based Token Standard for Ensuring Non-Custodial Recurring Payments2023 IEEE 1st Ukrainian Distributed Ledger Technology Forum (UADLTF)10.1109/UADLTF61495.2023.10548531(1-6)Online publication date: 27-Oct-2023
https://doi.org/10.1109/UADLTF61495.2023.10548531
Patrascoiu O(2023)Performance and Scalability of DMN-Based LCNC Platforms2023 ACM/IEEE International Conference on Model Driven Engineering Languages and Systems Companion (MODELS-C)10.1109/MODELS-C59198.2023.00136(863-867)Online publication date: 1-Oct-2023
https://doi.org/10.1109/MODELS-C59198.2023.00136
Grybniak SGoga NNashyvan OMihai RMazurok ILeonchyk YDatta GOzkul OMarian C(2022)Recurring Payments on EVM-based Platforms2022 IEEE 1st Global Emerging Technology Blockchain Forum: Blockchain & Beyond (iGETblockchain)10.1109/iGETblockchain56591.2022.10087077(1-6)Online publication date: 7-Nov-2022
https://doi.org/10.1109/iGETblockchain56591.2022.10087077
Li YXia LWeirich S(2021)Reasoning about the garden of forking pathsProceedings of the ACM on Programming Languages10.1145/34735855:ICFP(1-28)Online publication date: 19-Aug-2021
https://dl.acm.org/doi/10.1145/3473585
Tsushima KTrong BGlück RHu Z(2020)An Efficient Composition of Bidirectional Programs by Memoization and Lazy UpdateFunctional and Logic Programming10.1007/978-3-030-59025-3_10(159-178)Online publication date: 2-Sep-2020
https://doi.org/10.1007/978-3-030-59025-3_10
Hackett JHutton G(2019)Call-by-need is clairvoyant call-by-valueProceedings of the ACM on Programming Languages10.1145/33417183:ICFP(1-23)Online publication date: 26-Jul-2019
https://dl.acm.org/doi/10.1145/3341718
Prince DPerugini S(2018)An application of the Actor model of concurrency in PythonJournal of Computing Sciences in Colleges10.5555/3280489.328049734:1(35-43)Online publication date: 1-Oct-2018
https://dl.acm.org/doi/10.5555/3280489.3280497
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

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

A self-applicable online partial evaluator for recursive flowchart languages

O, partial evaluator, where art thou?

Distributed Lazy Evaluation: A Big-Step Mechanised Semantics