article

Free access

Thunks: a way of compiling procedure statements with some comments on procedure declarations

Author:

P. Z. IngermanAuthors Info & Claims

Communications of the ACM, Volume 4, Issue 1

Pages 55 - 58

https://doi.org/10.1145/366062.366084

Published: 01 January 1961 Publication History

PDF eReader

Cited By

View all

Ben-David NBlelloch G(2025)Fast and fair randomized wait-free locksDistributed Computing10.1007/s00446-024-00474-4Online publication date: 24-Jan-2025
https://doi.org/10.1007/s00446-024-00474-4
Imran MDin MRehman MKim B(2023)MIA-NDN: Microservice-Centric Interest Aggregation in Named Data NetworkingSensors10.3390/s2303141123:3(1411)Online publication date: 27-Jan-2023
https://doi.org/10.3390/s23031411
(2023)BibliographyEngineering a Compiler10.1016/B978-0-12-815412-0.00023-1(793-813)Online publication date: 2023
https://doi.org/10.1016/B978-0-12-815412-0.00023-1
Show More Cited By

Index Terms

Thunks: a way of compiling procedure statements with some comments on procedure declarations
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language features
        Procedures, functions and subroutines

Recommendations

Thunks and the λ-calculus

Thirty-five years ago, thunks were used to simulate call-by-name under call-by-value in Algol 60. Twenty years ago, Plotkin presented continuation-based simulations of call-by-name under call-by-value and vice versa in the λ-calculus. We connect all ...
Layout-sensitive language extensibility with SugarHaskell
Haskell '12: Proceedings of the 2012 Haskell Symposium

Programmers need convenient syntax to write elegant and concise programs. Consequently, the Haskell standard provides syntactic sugar for some scenarios (e.g., do notation for monadic code), authors of Haskell compilers provide syntactic sugar for more ...
Layout-sensitive language extensibility with SugarHaskell
Haskell '12

Programmers need convenient syntax to write elegant and concise programs. Consequently, the Haskell standard provides syntactic sugar for some scenarios (e.g., do notation for monadic code), authors of Haskell compilers provide syntactic sugar for more ...

Comments

Information & Contributors

Information

Published In

Communications of the ACM Volume 4, Issue 1

Jan. 1961

96 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/366062

Editor:
Alan J. Perlis
Carnegie Institute of Technology, Pittsburgh, PA

Issue’s Table of Contents

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 1961

Published in CACM Volume 4, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

60
Total Citations
View Citations
1,037
Total Downloads

Downloads (Last 12 months)150
Downloads (Last 6 weeks)18

Reflects downloads up to 31 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ben-David NBlelloch G(2025)Fast and fair randomized wait-free locksDistributed Computing10.1007/s00446-024-00474-4Online publication date: 24-Jan-2025
https://doi.org/10.1007/s00446-024-00474-4
Imran MDin MRehman MKim B(2023)MIA-NDN: Microservice-Centric Interest Aggregation in Named Data NetworkingSensors10.3390/s2303141123:3(1411)Online publication date: 27-Jan-2023
https://doi.org/10.3390/s23031411
(2023)BibliographyEngineering a Compiler10.1016/B978-0-12-815412-0.00023-1(793-813)Online publication date: 2023
https://doi.org/10.1016/B978-0-12-815412-0.00023-1
Cooper KTorczon L(2023)Implementing ProceduresEngineering a Compiler10.1016/B978-0-12-815412-0.00012-7(275-325)Online publication date: 2023
https://doi.org/10.1016/B978-0-12-815412-0.00012-7
Cooper KTorczon L(2023)Overview of CompilationEngineering a Compiler10.1016/B978-0-12-815412-0.00007-3(1-26)Online publication date: 2023
https://doi.org/10.1016/B978-0-12-815412-0.00007-3
Ben-David NBlelloch GMilani AWoelfel P(2022)Fast and Fair Randomized Wait-Free LocksProceedings of the 2022 ACM Symposium on Principles of Distributed Computing10.1145/3519270.3538448(187-197)Online publication date: 20-Jul-2022
https://dl.acm.org/doi/10.1145/3519270.3538448
Ben-David NBlelloch GWei YLee JAgrawal KSpear M(2022)Lock-free locks revisitedProceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming10.1145/3503221.3508433(278-293)Online publication date: 2-Apr-2022
https://dl.acm.org/doi/10.1145/3503221.3508433
Mastorakis SMtibaa ALee JMisra S(2020) ICedge : When Edge Computing Meets Information-Centric Networking IEEE Internet of Things Journal10.1109/JIOT.2020.29669247:5(4203-4217)Online publication date: May-2020
https://doi.org/10.1109/JIOT.2020.2966924
Díaz-Caro AGuillermo MMiquel AValiron BBouyer P(2019)Realizability in the unitary sphereProceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science10.5555/3470152.3470208(1-13)Online publication date: 24-Jun-2019
https://dl.acm.org/doi/10.5555/3470152.3470208
Mariano BReese JXu SNguyen TQiu XFoster JSolar-Lezama A(2019)Program synthesis with algebraic library specificationsProceedings of the ACM on Programming Languages10.1145/33605583:OOPSLA(1-25)Online publication date: 10-Oct-2019
https://dl.acm.org/doi/10.1145/3360558
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

Thunks and the λ-calculus

Layout-sensitive language extensibility with SugarHaskell

Layout-sensitive language extensibility with SugarHaskell

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Share

Share this Publication link

Share on social media

Affiliations