Resugaring

Pombrio, Justin; Krishnamurthi, Shriram

doi:10.1145/2594291.2594319

Cited by 16 publications

(6 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The idea of resugaring [42] is to print evaluation sequences in a core language in terms of a surface syntax. Here we show that, without any extension, BIYACC is already capable of propagating some AST changes that result from evaluation back to the concrete syntax, subsuming a part of Pombrio and Krishnamurthi's work [42,43].…”

Section: Syntactic Sugar and Resugaringmentioning

confidence: 99%

Unifying Parsing and Reflective Printing for Fully Disambiguated Grammars

Zhu

Zhang

et al. 2020

New Gener. Comput.

View full text Add to dashboard Cite

Language designers usually need to implement parsers and printers. Despite being two closely related programs, in practice they are often designed separately, and then need to be revised and kept consistent as the language evolves. It will be more convenient if the parser and printer can be unified and developed in a single program, with their consistency guaranteed automatically. Furthermore, in certain scenarios (like showing compiler optimisation results to the programmer), it is desirable to have a more powerful reflective printer that, when an abstract syntax tree corresponding to a piece of program text is modified, can propagate the modification to the program text while preserving layouts, comments, and syntactic sugar. To address these needs, we propose a domain-specific language BIYACC, whose programs denote both a parser and a reflective printer for a fully disambiguated context-free grammar. BIYACC is based on the theory of bidirectional transformations, which helps to guarantee by construction that the generated pairs of parsers and reflective printers are consistent. Handling grammatical ambiguity is particularly challenging: we propose an approach based on generalised parsing and disambiguation filters, which produce all the parse results and (try to) select the only correct one in the parsing direction; the filters are carefully bidirectionalised so that they also work in the printing direction and do not break the consistency between the parsers and reflective printers. We show that BIYACC is capable of facilitating many tasks such as Pombrio and Krishnamurthi's 'resugaring', simple refactoring, and language evolution.

show abstract

Section: Syntactic Sugar and Resugaringmentioning

confidence: 99%

Unifying Parsing and Reflective Printing for Fully Disambiguated Grammars

Zhu

Zhang

et al. 2020

New Gener. Comput.

View full text Add to dashboard Cite

show abstract

“…4). -We demonstrate the programmability of HOBiT with examples such as desugaring/resugaring [26] (Sect. 6).…”

Section: Contributionsmentioning

confidence: 99%

“…In this section, we demonstrate the programmability of HOBiT using the example of bidirectional desugaring [26]. Desugaring is a standard process for most programming languages, and making it bidirectional allows information in desugared form to be propagated back to the surface programs.…”

Section: An Involved Example: Desugaringmentioning

confidence: 99%

“…Desugaring is a standard process for most programming languages, and making it bidirectional allows information in desugared form to be propagated back to the surface programs. It is argued convincingly in [26] that such bidirectional propagation (coined resugaring) is effective in mapping reduction sequences of desugared programs into those of the surface programs.…”

Section: An Involved Example: Desugaringmentioning

confidence: 99%

“…If we were to present the above results as the evaluation steps in the surface language, one may argue that the second result above does not correspond to a valid evaluation step in the surface language. In [26], AST nodes introduced in desugaring are marked with the information of the original sugared syntax, and resugaring results containing the marked nodes will be skipped, as they do not correspond to any reduction step in the surface language. The marking also makes the backwards behaviour more predictable and stable for drastic changes on the view, as the desugaring becomes injective with this change.…”

Section: An Involved Example: Desugaringmentioning

confidence: 99%

See 2 more Smart Citations

HOBiT: Programming Lenses Without Using Lens Combinators

Matsuda

Wang

2018

Programming Languages and Systems

View full text Add to dashboard Cite

We propose HOBiT, a higher-order bidirectional programming language, in which users can write bidirectional programs in the familiar style of conventional functional programming, while enjoying the full expressiveness of lenses. A bidirectional transformation, or a lens, is a pair of mappings between source and view data objects, one in each direction. When the view is modified, the source is updated accordingly with respect to some laws-a pattern that is found in databases, modeldriven development, compiler construction, and so on. The most common way of programming lenses is with lens combinators, which are lens-tolens functions that compose simpler lenses to form more complex ones. Lens combinators preserve the bidirectionality of lenses and are expressive; but they compel programmers to a specialised point-free style-i.e., no naming of intermediate computation results-limiting the scalability of bidirectional programming. To address this issue, we propose a new bidirectional programming language HOBiT, in which lenses are represented as standard functions, and combinators are mapped to language constructs with binders. This design transforms bidirectional programming, enabling programmers to write bidirectional programs in a flexible functional style and at the same time access the full expressiveness of lenses. We formally define the syntax, type system, and the semantics of the language, and then show that programs in HOBiT satisfy bidirectionality. Additionally, we demonstrate HOBiT's programmability with examples.

show abstract

Composing Bidirectional Programs Monadically

Xia

Orchard

Wang

2019

Programming Languages and Systems

View full text Add to dashboard Cite

Software frequently converts data from one representation to another and vice versa. Naïvely specifying both conversion directions separately is error prone and introduces conceptual duplication. Instead, bidirectional programming techniques allow programs to be written which can be interpreted in both directions. However, these techniques often employ unfamiliar programming idioms via restricted, specialised combinator libraries. Instead, we introduce a framework for composing bidirectional programs monadically, enabling bidirectional programming with familiar abstractions in functional languages such as Haskell. We demonstrate the generality of our approach applied to parsers/printers, lenses, and generators/predicates. We show how to leverage compositionality and equational reasoning for the verification of round-tripping properties for such monadic bidirectional programs.

show abstract

Resugaring

Cited by 16 publications

References 23 publications

Unifying Parsing and Reflective Printing for Fully Disambiguated Grammars

Unifying Parsing and Reflective Printing for Fully Disambiguated Grammars

HOBiT: Programming Lenses Without Using Lens Combinators

Composing Bidirectional Programs Monadically

Contact Info

Product

Resources

About