Embedding invertible languages with binders: a case of the FliPpr language

Matsuda, Kazutaka; Wang, Meng

doi:10.1145/3242744.3242758

Cited by 5 publications

(7 citation statements)

References 37 publications

(69 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Currently, our prototype implementation is standalone, preventing users from writing functions in another language to be used in lift, and from using functions obtain by fwd and bwd in the other language. Although prototypical implementation of a compiler of Sparcl to Haskell is in progress, a seamless integration through an embedded implementation would be desirable [Matsuda and Wang 2018b]. Another direction is to extend our approach to bidirectional transformations [Foster et al 2007] to create the notion of partially bidirectional programming.…”

Section: Resultsmentioning

confidence: 99%

Sparcl: a language for partially-invertible computation

Matsuda

Wang

2020

Proc. ACM Program. Lang.

Self Cite

View full text Add to dashboard Cite

Invertibility is a fundamental concept in computer science, with various manifestations in software development (serializer/deserializer, parser/printer, redo/undo, compressor/decompressor, and so on). Full invertibility necessarily requires bijectivity, but the direct approach of composing bijective functions to develop invertible programs is too restrictive to be useful. In this paper, we take a different approach by focusing on partiallyinvertible functionsÐfunctions that become invertible if some of their arguments are fixed. The simplest example of such is addition, which becomes invertible when fixing one of the operands. More involved examples include entropy-based compression methods (e.g., Huffman coding), which carry the occurrence frequency of input symbols (in certain formats such as Huffman tree), and fixing this frequency information makes the compression methods invertible. We develop a language Sparcl for programming such functions in a natural way, where partial-invertibility is the norm and bijectivity is a special case, hence gaining significant expressiveness without compromising correctness. The challenge in designing such a language is to allow ordinary programming (the łpartiallyž part) to interact with the invertible part freely, and yet guarantee invertibility by construction. The language Sparcl is linear-typed, and has a type constructor to distinguish data that are subject to invertible computation and those that are not. We present the syntax, type system, and semantics of the language, and prove that Sparcl correctly guarantees invertibility for its programs. We demonstrate the expressiveness of Sparcl with examples including tree rebuilding from preorder and inorder traversals and Huffman coding. CCS Concepts: • Software and its engineering → Functional languages; Domain specific languages.

show abstract

Section: Resultsmentioning

confidence: 99%

Sparcl: a language for partially-invertible computation

Matsuda

Wang

2020

Proc. ACM Program. Lang.

Self Cite

View full text Add to dashboard Cite

show abstract

“…In contrast, our approach reuses the standard type class hierarchy, further extending the expressive power of bidirectional programming in Haskell. FliPpr [17,19] is an invertible language that generates a parser from a definition of a pretty printer. In this paper, our biparser definitions are more similar to those of parsers than printers.…”

Section: Discussion and Related Workmentioning

confidence: 99%

“…Writing parsers and printers by hand is often tedious due to the redundancy implied by their inverse-like relation. Thus, various approaches have been proposed for reducing the effort of writing parsers/printers by generating both from a common definition [30,17,19].…”

Section: Further Examples Of Bxmentioning

confidence: 99%

Composing Bidirectional Programs Monadically

Xia

Orchard

Wang

2019

Programming Languages and Systems

Self Cite

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

“…Much research has been devoted to describing parsers and printers in a single program. For example, both Rendel and Ostermann [44] and Matsuda and Wang [36,37] adopt a combinator-based approach 10 (whereas we use a generator-based approach), where small components are glued together to yield more sophisticated behaviour, and can guarantee properties similar to Theorem 1 with cst replaced by ast in the equations. (Let us call the variant version Theorem 1 0 , since it will be used quite often later.)…”

Section: Related Workmentioning

confidence: 99%

“…Expr, Term, and Factor) to express operator priority, and write printing strategies to produce (preserve) 10FL01 10 Although they use different implementation techniques, we will not dive into them in our related work. 10FL02 See Matsuda and Wang's related work for a comparison [36].…”

Section: Related Workmentioning

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

Embedding invertible languages with binders: a case of the FliPpr language

Cited by 5 publications

References 37 publications

Sparcl: a language for partially-invertible computation

Sparcl: a language for partially-invertible computation

Composing Bidirectional Programs Monadically

Unifying Parsing and Reflective Printing for Fully Disambiguated Grammars

Contact Info

Product

Resources

About