research-article

Hygienic resugaring of compositional desugaring

Authors:

Justin Pombrio,

Shriram KrishnamurthiAuthors Info & Claims

ACM SIGPLAN Notices, Volume 50, Issue 9

Pages 75 - 87

https://doi.org/10.1145/2858949.2784755

Published: 29 August 2015 Publication History

Abstract

Syntactic sugar is widely used in language implementation. Its benefits are, however, offset by the comprehension problems it presents to programmers once their program has been transformed. In particular, after a transformed program has begun to evaluate (or otherwise be altered by a black-box process), it can become unrecognizable. We present a new approach to _resugaring_ programs, which is the act of reflecting evaluation steps in the core language in terms of the syntactic sugar that the programmer used. Relative to prior work, our approach has two important advances: it handles hygiene, and it allows almost arbitrary rewriting rules (as opposed to restricted patterns). We do this in the context of a DAG representation of programs, rather than more traditional trees.

References

[1]

M. D. Adams. Towards the essence of hygiene. In Principles of Programming Languages, 2015.

Digital Library

[2]

A. Chlipala. Parametric higher-order abstract syntax for mechanized semantics. In International Conference on Functional Programming, 2008.

Digital Library

[3]

S. Erdweg, T. van der Storm, and Y. Dai. Capture-avoiding and hygienic program transformations. In European Conference on Object-Oriented Programming, 2014.

[4]

M. Felleisen and R. Hieb. The revised report on the syntactic theories of sequential control and state. Theoretical Computer Science, 103(2): 235–271, 1992.

Digital Library

[5]

M. J. Gabbay and A. M. Pitts. A new approach to abstract syntax with variable binding. Formal Aspects of Computing, 13(3–5):341–363, 2000.

Digital Library

[6]

J. Hennessy. Symbolic debugging of optimized code. Transactions on Programming Languages and Systems, 4(3), 1982.

Digital Library

[7]

D. Herman and M. Wand. A theory of hygienic macros. In European Symposium on Programming Languages and Systems, 2008.

Digital Library

[8]

E. Kohlbecker, D. P. Friedman, M. Felleisen, and B. Duba. Hygienic macro expansion. In ACM Conference on LISP and Functional Programming, 1986.

Digital Library

[9]

G. Konat, L. Kats, G. Wachsmuth, and E. Visser. Declarative name binding and scope rules. In Software Language Engineering, 2012.

[10]

P. J. Landin. The mechanical evaluation of expressions. The Computer Journal, 6(4):308–320, 1964.

[11]

P. Neron, A. Tolmach, E. Visser, and G. Wachsmuth. A theory of name resolution. In European Symposium on Programming Languages and Systems, 2015. To appear.

[12]

F. Pfenning and C. Elliot. Higher-order abstract syntax. In Programming Languages Design and Implementation, 1988.

Digital Library

[13]

J. Pombrio and S. Krishnamurthi. Resugaring: Lifting evaluation sequences through syntactic sugar. In Programming Languages Design and Implementation, 2014.

Digital Library

[14]

P. Sewell, F. Z. Nardelli, S. Owens, G. Peskine, T. Ridge, S. Sarkar, and R. Strnisa. Ott: Effective tool support for the working semanticist. In International Conference on Functional Programming, 2007.

Digital Library

[15]

M. Sperber, R. K. Dybvig, M. Flatt, A. van Straaten, R. Findler, and J. Matthews. Revised {6} Report on the Algorithmic Language Scheme. Cambridge University Press, 2010.

Digital Library

[16]

P. Stansifer and M. Wand. Romeo: a system for more flexible bindingsafe programming. In International Conference on Functional Programming, 2014.

Digital Library

[17]

A. Van Deursen, P. Klint, and F. Tip. Origin tracking. Journal of Symbolic Computation, 15(5–6), 1993.

Digital Library

[18]

S. Weirich, B. Yorgey, and T. Sheard. Binders unbound. In International Conference on Functional Programming, 2011.

Digital Library

Cited By

Kurniawan OPoskitt CAl Hoque ILee NJégourel CSockalingam N(2023)How Helpful do Novice Programmers Find the Feedback of an Automated Repair Tool?2023 IEEE International Conference on Teaching, Assessment and Learning for Engineering (TALE)10.1109/TALE56641.2023.10398393(1-6)Online publication date: 28-Nov-2023
https://doi.org/10.1109/TALE56641.2023.10398393
Yang ZXiao YGuan ZHu Z(2022)A Lazy Desugaring System for Evaluating Programs with SugarsFunctional and Logic Programming10.1007/978-3-030-99461-7_14(243-261)Online publication date: 10-May-2022
https://dl.acm.org/doi/10.1007/978-3-030-99461-7_14
Schuster CDisney TFlanagan C(2016)Macrofication: Refactoring by Reverse Macro ExpansionProgramming Languages and Systems10.1007/978-3-662-49498-1_25(644-671)Online publication date: 2016
https://doi.org/10.1007/978-3-662-49498-1_25
Show More Cited By

Index Terms

Hygienic resugaring of compositional desugaring
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language features

Recommendations

Resugaring: lifting evaluation sequences through syntactic sugar
PLDI '14: Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation

Syntactic sugar is pervasive in language technology. It is used to shrink the size of a core language; to define domain-specific languages; and even to let programmers extend their language. Unfortunately, syntactic sugar is eliminated by transformation,...
Hygienic resugaring of compositional desugaring
ICFP 2015: Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming

Syntactic sugar is widely used in language implementation. Its benefits are, however, offset by the comprehension problems it presents to programmers once their program has been transformed. In particular, after a transformed program has begun to ...
Resugaring: lifting evaluation sequences through syntactic sugar
PLDI '14

Syntactic sugar is pervasive in language technology. It is used to shrink the size of a core language; to define domain-specific languages; and even to let programmers extend their language. Unfortunately, syntactic sugar is eliminated by transformation,...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGPLAN Notices

ACM SIGPLAN Notices Volume 50, Issue 9

ICFP '15

September 2015

436 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/2858949

Editor:
Andy Gill
University of Kansas, Lawrence, KS

Issue’s Table of Contents

ICFP 2015: Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming
August 2015
436 pages
ISBN:9781450336697
DOI:10.1145/2784731
General Chair:
Kathleen Fisher
Tufts University, USA
,
Program Chair:
John Reppy
University of Chicago, USA

Copyright © 2015 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 the author(s) 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: 29 August 2015

Published in SIGPLAN Volume 50, Issue 9

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

National Science Foundation

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
255
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)1

Reflects downloads up to 13 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Kurniawan OPoskitt CAl Hoque ILee NJégourel CSockalingam N(2023)How Helpful do Novice Programmers Find the Feedback of an Automated Repair Tool?2023 IEEE International Conference on Teaching, Assessment and Learning for Engineering (TALE)10.1109/TALE56641.2023.10398393(1-6)Online publication date: 28-Nov-2023
https://doi.org/10.1109/TALE56641.2023.10398393
Yang ZXiao YGuan ZHu Z(2022)A Lazy Desugaring System for Evaluating Programs with SugarsFunctional and Logic Programming10.1007/978-3-030-99461-7_14(243-261)Online publication date: 10-May-2022
https://dl.acm.org/doi/10.1007/978-3-030-99461-7_14
Schuster CDisney TFlanagan C(2016)Macrofication: Refactoring by Reverse Macro ExpansionProgramming Languages and Systems10.1007/978-3-662-49498-1_25(644-671)Online publication date: 2016
https://doi.org/10.1007/978-3-662-49498-1_25
Chang SBallantyne MTurner MBowman W(2019)Dependent type systems as macrosProceedings of the ACM on Programming Languages10.1145/33710714:POPL(1-29)Online publication date: 20-Dec-2019
https://dl.acm.org/doi/10.1145/3371071
Pombrio JKrishnamurthi SWand M(2017)Inferring scope through syntactic sugarProceedings of the ACM on Programming Languages10.1145/31102881:ICFP(1-28)Online publication date: 29-Aug-2017
https://dl.acm.org/doi/10.1145/3110288
Ricciotti WStolarek JPerera RCheney J(2017)Imperative functional programs that explain their workProceedings of the ACM on Programming Languages10.1145/31102581:ICFP(1-28)Online publication date: 29-Aug-2017
https://dl.acm.org/doi/10.1145/3110258
Schuster CDisney TFlanagan C(2016)MacroficationProceedings of the 25th European Symposium on Programming Languages and Systems - Volume 963210.5555/3089528.3089553(644-671)Online publication date: 2-Apr-2016
https://dl.acm.org/doi/10.5555/3089528.3089553
Ritschel NErdweg SPaige RDi Ruscio DVölter M(2015)Modular capture avoidance for program transformationsProceedings of the 2015 ACM SIGPLAN International Conference on Software Language Engineering10.1145/2814251.2814260(59-70)Online publication date: 26-Oct-2015
https://dl.acm.org/doi/10.1145/2814251.2814260

View Options

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

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents