检索结果-内蒙古大学图书馆

The essence of bidirectional programming

Science China(Information Sciences) 2015年第5期58卷 76-96页

作者： FISCHER Sebastian HU ZhenJiang PACHECO Hugo Department of Computing Science Christian-Albrechts-University of Kiel Information Systems Architecture Research Division National Institute of Informatics Department of Informatics The Graduate University for Advanced Studies (SOKENDAI) School of Electronics Engineering and Computer Science Peking University Department of Computer Science Cornell University

bidirectional transformations(BXs), programs with a forward transformation and a backward transformation that maintain consistency between input and output, are routinely written in ways that do not let programmers specify their behavior completely. Several bidirectional programming languages exist to aid programmers in writing BXs with increased maintainability but decreased expressiveness. Such languages allow programmers to write BXs as one program for both directions, which is easier to maintain than separate programs for each direction. However, the maintainability provided by existing bidirectional languages comes at the cost of expressiveness because the ambiguity of synchronization is solved by default strategies which are hidden from programmers. The programmers’ inability to influence synchronization strategies has led to the proposal of a vast number of approaches that consider tailor-made synchronization strategies for particular *** this paper, we argue that such ambiguity is essential for BX and advocate that the synchronization strategy should not be hidden from programmers but considered from the start. We propose a novel approach to specifying so-called well-behaved bidirectional programs by their backward transformations, capable of expressing all aspects of a BX while retaining maintainability. Soundness of our approach results from a systematic analysis, based on existing mathematical concepts, of the instrumental laws of well-behaved BXs. We show that well-behaved BXs are uniquely determined by their backward transformations and corresponding forward transformations can be obtained for free.

关键词： bidirectional transformation software adaption and coevolution bidirectional programming

来源：评论

学校读者我要写书评

暂无评论

Monadic Combinators for "Putback" Style bidirectional programming 14

Monadic Combinators for "Putback" Style Bidirectional Progra...

引用

ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM)

作者： Pacheco, Hugo Hu, Zhenjiang Fischer, Sebastian Natl Inst Informat Tokyo Japan Christian Albretchs Univ Kiel Kiel Germany

ISBN: (纸本)9781450326193

bidirectional transformations, in particular lenses, are programs with a forward get transformation and a backward putback transformation that keep source and view data types synchronized. Several bidirectional programming languages exist to aid programmers in writing a (sort of) forward transformation, and deriving a backward transformation for free. However, the maintainability offered by such languages comes at the cost of expressiveness and (more importantly) predictability because the ambiguity of synchronization - handled by the putback transformation-is solved by default strategies over which programmers have little control. In this paper, we argue that controlling such ambiguity is essential for bidirectional transformations and propose a novel language in which programmers write a (sort of) putback transformation, and get the unique get transformation for free. Like traditional bidirectional languages, our put-oriented language allows reasoning about the correctness of defined transformations from the properties of their building blocks. But it allows programmers to describe the behavior of a bidirectional transformation much more precisely, while retaining the maintainability of writing a single program. We demonstrate the practical power of the new approach through a series of examples, ranging from simple ones that illustrate traditional lenses to complex ones for which our putback-based approach is central to specifying nontrivial update strategies.

关键词： bidirectional programming view update lenses Haskell monads generic functional programming

来源：评论

学校读者我要写书评

暂无评论

Prodirect Manipulation: bidirectional programming for the Masses 16

Prodirect Manipulation: Bidirectional Programming for the Ma...

引用

38th IEEE/ACM International Conference on Software Engineering Companion (ICSE)

作者： Chugh, Ravi Univ Chicago Dept Comp Sci Ryerson Lab 1100 E 58th St Chicago IL 60637 USA

ISBN: (纸本)9781450342056

Software interfaces today generally fall at either end of a spectrum. On one end are programmable systems, which allow expert users (i.e. programmers) to write software artifacts that describe complex abstractions, but programs are disconnected from their eventual output. On the other end are domain-specific graphical user interfaces (GUIs), which allow end users (i.e. non p-programmers) to easily create varied content but present insurmountable walls when a desired feature is not built-in. Both programmatic and direct manipulation have distinct strengths, but users must typically choose one over the other or use some ad-hoc combination of systems. Our goal, put simply, is to bridge this divide. We envision novel software systems that tightly couple programmatic and direct manipulation - a combination we dub prodirect manipulation - for a variety of use cases. This will require advances in a broad range of software engineering disciplines, from program analysis and program synthesis technology to user interface design and evaluation. In this extended abstract, we propose two general strategies - real-time program synthesis and domain p-specific synthesis of general-purpose programs - that may prove fruitful for overcoming the technical challenges. We also discuss metrics that will be important in evaluating the usability and utility of prodirect manipulation systems.

关键词： Prodirect Manipulation Program Synthesis End User programming Human-Computer Interaction bidirectional programming

来源：评论

学校读者我要写书评

暂无评论

A Framework for Synchronization Between Feature Configurations and Use Cases Based on bidirectional programming 24

A Framework for Synchronization Between Feature Configuratio...

引用

24th IEEE International Requirements Engineering Conference Workshops (RWE)

作者： Zhao, Weize Zhao, Haiyan Hu, Zhenjiang Peking Univ Beijing Peoples R China Natl Inst Informat Tokyo Japan

ISBN: (纸本)9781509036943

Model-Driven Development (MDD) is a widely adopted approach to Requirement Engineering (RE). One basic research issue in Model-Driven Requirement Engineering (MODRE) is requirements validation, which focuses on how to validate whether the requirements models meet stakeholders' needs or not. Several lines of work have been performed on the transformation between feature configurations, which are responsible for specifying a software in feature-oriented approach, and use cases, which are easy to understand and often used to describe system behaviors to stakeholders. However, most of the existing automated derivation methods about feature configurations and use cases are either in one direction or the other. Therefore, after validating the use cases, the adjustment made by stakeholders cannot be traced back to feature configurations automatically. In this paper, we focus on synchronization between these two vital software artifacts. And we propose a framework that uses putback-based bidirectional programming to guarantee the correctness of this synchronization.

关键词： Feature model Use case Synchronization bidirectional programming

来源：评论

学校读者我要写书评

暂无评论

Introducing bidirectional programming in Constructive Solid Geometry-Based CAD 23

Introducing Bidirectional Programming in Constructive Solid ...

引用

11th ACM Symposium on Spatial User Interaction (SUI)

作者： Gonzalez, J. Felipe Kieken, Danny Pietrzak, Thomas Carleton Univ Univ Lille CNRS InriaCent LilleUMR 9189 CRIStAL Lille France Univ Lille CNRS Inria Cent LilleUMR 9189 CRIStAL Lille France

ISBN: (纸本)9798400702815

3D Computer-Aided Design (CAD) users need to overcome several obstacles to benefit from the flexibility of programmatic interface tools. Besides the barriers of any programming language, users face challenges inherent to 3D spatial interaction. Scripting simple operations, such as moving an element in 3D space, can be significantly more challenging than performing the same task using direct manipulation. We introduce the concept of bidirectional programming for Constructive Solid Geometry (CSG) CAD tools, informed by interviews we performed with programmatic interface users. We describe how users can navigate and edit the 3D model using direct manipulation in the view or code editing while the system ensures consistency between both spaces. We also detail a proof-of-concept implementation using a modified version of OpenSCAD.

关键词： bidirectional programming 3D programmatic CAD software CAD software OpenSCAD fabrication

来源：评论

学校读者我要写书评

暂无评论

Applicative bidirectional programming with Lenses 2015

Applicative Bidirectional Programming with Lenses

引用

20th ACM SIGPLAN International Conference on Functional programming (ICFP)

作者： Matsuda, Kazutaka Wang, Meng Tohoku Univ Sendai Miyagi 980 Japan Univ Kent Canterbury CT2 7NZ Kent England

ISBN: (纸本)9781450336697

A bidirectional transformation 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. One way to reduce the development and maintenance effort of bidirectional transformations is to have specialized languages in which the resulting programs are bidirectional by construction-giving rise to the paradigm of bidirectional programming. In this paper, we develop a framework for applicative-style and higher-order bidirectional programming, in which we can write bidirectional transformations as unidirectional programs in standard functional languages, opening up access to the bundle of language features previously only available to conventional unidirectional languages. Our framework essentially bridges two very different approaches of bidirectional programming, namely the lens framework and Voigtlander's semantic bidirectionalization, creating a new programming style that is able to bag benefits from both.

关键词： bidirectional programming Lens bidirectionalization Free Theorem Functional programming Haskell Languages

来源：评论

学校读者我要写书评

暂无评论

Reusable Self-Adaptation through bidirectional programming 11

Reusable Self-Adaptation through Bidirectional Programming

引用

11th IEEE/ACM International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS)

作者： Colson, Kevin Dupuis, Robin Montrieux, Lionel Hu, Zhenjiang Uchitel, Sebastian Schobbens, Pierre-Yves Univ Namur Namur Belgium Natl Inst Informat Tokyo Japan Univ Buenos Aires Buenos Aires DF Argentina Imperial Coll London London England

ISBN: (纸本)9781450341875

In self-adaptive systems, an adaptation strategy can apply to several implementations of a target system. Reusing this strategy requires models of the target system that are independent of its implementation. In particular, configuration files must be transformed into abstract configurations, but correctly synchronizing these two representations is not trivial. We propose an approach that uses putback-based bidirectional programming to guarantee that this synchronization is correct by construction. We demonstrate the correctness of our approach and how it handles typical features of configuration files, such as implicit default values and context overriding. We also show that our approach can be used to migrate configuration files from one implementation to another. We illustrate our approach with a case study, where we use the same abstract model to adapt two web server implementations. For each implementation, we provide a bidirectional program that correctly synchronizes the configuration file with an abstract model of the configuration. A first scenario demonstrates that the same changes on the abstract model produce, for each implementation, a new configuration that correctly reflects the changes made to the abstract model, without side effects. A second scenario validates the migration of a configuration file from the format used by one web server implementation to another.

关键词： Self-adaptation synchronization bidirectional programming model abstraction

来源：评论

学校读者我要写书评

暂无评论

Formalizing semantic bidirectionalization and extensions with dependent types

引用

JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN programming 2017年第1期86卷 319-348页

作者： Grohne, Helmut Voigtlaender, Janis Univ Bonn Inst Comp Sci Romerstr 164 D-53117 Bonn Germany

bidirectional programming is concerned with pairs of transformations that together realize the forward and backward relationship between two data domains. Semantic bidirectionalization is a specific technique that takes a get-function (mapping forward from sources to views) as input and automatically gives a put-function (mapping an original source and an updated view back to an updated source), while guaranteeing standard well-behavedness properties. Proofs of those properties have been done by hand originally, and later extensions of the technique have also come with by-hand proofs or sketches thereof. Here we provide a formalization of semantic bidirectionalization and proof of those properties in the dependently typed programming language Agda. We then explore two previously considered variations of the original technique, using our initial formalization as a baseline and showing that the well-behavedness properties are preserved as adjustments are made. Also, we find that using very precise types pays off, as a means to express insight about the bidirectionalization technique and by even allowing us to further improve it. In particular, shape-changing updates are known to be problematic for semantic bidirectionalization, and one of the variations considered addresses this by using "shape bidirectionalizers". In the past, these have been thought of as extra components, but by leveraging information about the relationship between the shapes of sources and views now being expressed at the type level, we show that these "plug-ins" can sometimes be replaced by just type inference. Beside the results about bidirectionalization, the article may also serve as an introduction and concrete example of using Agda to formalize and verify applications of functional programming. (C) 2016 Elsevier Inc. All rights reserved.

关键词： bidirectional programming Dependent types Formal verification

来源：评论

学校读者我要写书评

暂无评论

Reflecting on Random Generation

引用

PROCEEDINGS OF THE ACM ON programming LANGUAGES-PACMPL 2023年第ICFP期7卷 322–355页

作者： Goldstein, Harrison Frohlich, Samantha Wang, Meng Pierce, Benjamin C. Univ Penn Philadelphia PA 19104 USA Univ Bristol Bristol Avon England

Expert users of property-based testing often labor to craft random generators that encode detailed knowledge about what it means for a test input to be valid and interesting. Fortunately, the fruits of this labor can also be put to other good uses. In the bidirectional programming literature, for example, generators have been repurposed as validity checkers, while Python's Hypothesis library uses them to shrink and mutate test inputs. To unify and generalize these uses (and more), we propose reflective generators, a new foundation for random data generators that can "reflect" on an input value to calculate the random choices that could have been made to produce it. Reflective generators combine ideas from two existing abstractions: free generators and partial monadic profunctors. They can be used to implement and enhance the aforementioned shrinking and mutation algorithms, generalizing them to work for any values that could have been produced by the generator, not just ones for which a trace of the generator's execution is available. Beyond shrinking and mutation, reflective generators simplify and generalize a published algorithm for example-based generation;they can also be used as checkers, partial value completers, and test data producers like enumerators.

关键词： bidirectional programming property-based testing random generation

来源：评论

学校读者我要写书评

暂无评论

Synthesizing Bijective Lenses

引用

PROCEEDINGS OF THE ACM ON programming LANGUAGES-PACMPL 2018年第POPL期2卷 1–30页

作者： Miltner, Anders Fisher, Kathleen Pierce, Benjamin C. Walker, David Zdancewic, Steve Princeton Univ Princeton NJ 08544 USA Tufts Univ Boston MA 02111 USA Univ Penn Philadelphia PA 19104 USA

bidirectional transformations between different data representations occur frequently in modern software systems. They appear as serializers and deserializers, as parsers and pretty printers, as database views and view updaters, and as a multitude of different kinds of ad hoc data converters. Manually building bidirectional transfonnations-by writing two separate functions that are intended to be inverses is tedious and error prone. A better approach is to use a domain-specific language in which both directions can be written as a single expression. However, these domain-specific languages can be difficult to program in, requiring programmers to manage fiddly details while working in a complex type system. We present an alternative approach. Instead of coding transformations manually, we synthesize them from declarative format descriptions and examples. Specifically, we present Optician, a tool for type-directed synthesis of bijective string transformers. The inputs to Optician are a pair of ordinary regular expressions representing two data formats and a few concrete examples for disambiguation. The output is a well-typed program in Boomerang (a bidirectional language based on the theory of lenses). The main technical challenge involves navigating the vast program search space efficiently. In particular, and unlike most prior work on type-directed synthesis, our system operates in the context of a language with a rich equivalence relation on types (the theory of regular expressions). Consequently, program synthesis requires search in two dimensions: First, our synthesis algorithm must find a pair of "syntactically compatible types," and second, using the structure of those types, it must find a type- and example-compliant term. Our key insight is that it is possible to reduce the size of this search space without losing any computational power by defining a new language of lenses designed specifically for synthesis. The new language is free from arbitrary function

关键词： bidirectional programming Program Synthesis Type-Directed Synthesis Type Systems

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：