Hostname: page-component-78c5997874-ndw9j Total loading time: 0 Render date: 2024-11-19T16:04:11.673Z Has data issue: false hasContentIssue false
  • English
  • Français

Enhancing semantic bidirectionalization via shape bidirectionalizer plug-ins

Part of: JFP Research Articles

Published online by Cambridge University Press:  14 October 2013

JANIS VOIGTLÄNDER ,
ZHENJIANG HU ,
KAZUTAKA MATSUDA  and
MENG WANG
JANIS VOIGTLÄNDER
Affiliation:
University of Bonn, 53113 Bonn, Germany (e-mail: jv@informatik.uni-bonn.de)
ZHENJIANG HU
Affiliation:
National Institute of Informatics, Tokyo 101-8430, Japan (e-mail: hu@nii.ac.jp)
KAZUTAKA MATSUDA
Affiliation:
University of Tokyo, Tokyo 113-0033, Japan (e-mail: kztk@is.s.u-tokyo.ac.jp)
MENG WANG
Affiliation:
Chalmers University of Technology, 412 96 Gothenburg, Sweden (e-mail: wmeng@chalmers.se)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Matsuda et al. (Matsuda, K., Hu, Z., Nakano, K., Hamana, M. & Takeichi, M. (2007) Bidirectionalization transformation based on automatic derivation of view complement functions. In Proceedings of the International Conference on Functional Programming. ACM Press, pp. 47–58) and Voigtländer (Voigtländer, J. (2009) Bidirectionalization for free! In Proceedings of Principles of Programming Languages. ACM Press, pp. 165–176) have introduced two techniques that given a source-to-view function provide an update propagation function mapping an original source and an updated view back to an updated source, subject to standard consistency conditions. Previously, we developed a synthesis of the two techniques, based on a separation of shape and content aspects (Voigtländer, J., Hu, Z., Matsuda, K. & Wang, M. (2010) Combining syntactic and semantic bidirectionalization. In Proceedings of the International Conference on Functional Programming. ACM Press, pp. 181–192). Here we carry that idea further, reworking the technique of Voigtländer such that any shape bidirectionalizer (based on the work of Matsuda et al. (2007) or not) can be used as a plug-in, to good effect. We also provide a data-type-generic account, enabling wider reuse, including the use of pluggable bidirectionalization itself as a plug-in.

Type
Articles
Information
Journal of Functional Programming , Volume 23 , Issue 5 , September 2013 , pp. 515 - 551
Copyright
Copyright © Cambridge University Press 2013 

References

Abbott, M., Altenkirch, T. & Ghani, N. (2003) Categories of containers. In Proceedings of Foundations of Software Science and Computational Structures, LNCS, vol. 2620. Springer-Verlag, pp. 23–38.CrossRefGoogle Scholar
Bancilhon, F. & Spyratos, N. (1981) Update semantics of relational views. ACM Trans. Database Syst. 6 (3), 557–575.CrossRefGoogle Scholar
Bohannon, A., Foster, J. N., Pierce, B. C., Pilkiewicz, A. & Schmitt, A. (2008) Boomerang: Resourceful lenses for string data. In Proceedings of Principles of Programming Languages. ACM Press, pp. 407–419.Google Scholar
Bohannon, A., Pierce, B. C. & Vaughan, J. A. (2006) Relational lenses: A language for updatable views. In Proceedings of Principles of Database Systems. ACM Press, pp. 338–347.Google Scholar
Czarnecki, K., Foster, J. N., Hu, Z., Lämmel, R., Schürr, A. & Terwilliger, J. F. (2009) Bidirectional transformations: A cross-discipline perspective. In Proceedings of the International Conference on Model Transformation, LNCS, vol. 5563. Springer-Verlag, pp. 260–283.Google Scholar
Foster, J. N., Greenwald, M. B., Moore, J. T., Pierce, B. C. & Schmitt, A. (2007) Combinators for bidirectional tree transformations: A linguistic approach to the view-update problem. ACM Trans. Program. Lang. Syst. 29 (3), 17.CrossRefGoogle Scholar
Foster, J. N., Matsuda, K. & Voigtländer, J. (2012) Three complementary approaches to bidirectional programming. In Revised Lectures of Spring School on Generic and Indexed Programming 2010, LNCS, vol. 7470. Springer-Verlag, pp. 1–46.Google Scholar
Foster, J. N., Pilkiewicz, A. & Pierce, B. C. (2008) Quotient lenses. In Proceedings of the International Conference on Functional Programming. ACM Press, pp. 383–395.Google Scholar
Gibbons, J. & Oliveira, B. C. d. S. (2009) The essence of the iterator pattern. J. Funct. Program. 19 (3–4), 377–402.CrossRefGoogle Scholar
Giesl, J. (2000) Context-moving transformations for function verification. In Selected Papers on Logic-Based Program Synthesis and Transformation 1999, LNCS, vol. 1817. Springer-Verlag, pp. 293–312.CrossRefGoogle Scholar
Giesl, J., Kühnemann, A. & Voigtländer, J. (2007) Deaccumulation techniques for improving provability. J. Logic Algebr. Program. 71 (2), 79–113.CrossRefGoogle Scholar
Gottlob, G., Paolini, P. & Zicari, R. (1988) Properties and update semantics of consistent views. ACM Trans. Database Syst. 13 (4), 486–524.CrossRefGoogle Scholar
Hidaka, S., Hu, Z., Inaba, K., Kato, H., Matsuda, K. & Nakano, K. (2010) Bidirectionalizing graph transformations. In Proceedings of the International Conference on Functional Programming. ACM Press, pp. 205–216.Google Scholar
Hu, Z., Mu, S.-C. & Takeichi, M. (2008) A programmable editor for developing structured documents based on bidirectional transformations. Higher-Order Symb. Comput. 21 (1–2), 89–118.CrossRefGoogle Scholar
Jay, C. B. (1995) A semantics for shape. Sci. Comput. Program. 25 (2–3), 251–283.CrossRefGoogle Scholar
Keller, A. M. (1987) Comments on Bancilhon and Spyratos' ‘Update semantics and relational views’. ACM Trans. Database Syst. 12 (3), 521–523.CrossRefGoogle Scholar
Matsuda, K., Hu, Z., Nakano, K., Hamana, M. & Takeichi, M. (2007) Bidirectionalization transformation based on automatic derivation of view complement functions. In Proceedings of the International Conference on Functional Programming. ACM Press, pp. 47–58.Google Scholar
Matsuda, K., Hu, Z., Nakano, K., Hamana, M. & Takeichi, M. (2009) Bidirectionalizing programs with duplication through complementary function derivation. Comput. Softw. 26 (2), 56–75 (In Japanese).Google Scholar
Matsuda, K. & Wang, M. (2013) Bidirectionalization for free with runtime recording. In Proceedings of Principles and Practice of Declarative Programming. ACM Press, pp. 297–308.Google Scholar
Pacheco, H. & Cunha, A. (2010) Generic point-free lenses. In Proceedings of Mathematics of Program Construction, LNCS, vol. 6120. Springer-Verlag, pp. 331–352.CrossRefGoogle Scholar
Pacheco, H., Cunha, A. & Hu, Z. (2012) Delta lenses over inductive types. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 49. Available at: http://journal.ub.tu-berlin.de/eceasst/issue/view/59Google Scholar
Pettorossi, A. (1977) Transformation of programs and use of tupling strategy. In Proceedings of Informatica 77, Bled, Yugoslavia. pp. 1–6.Google Scholar
Peyton Jones, S. L. (ed). (2003) Haskell 98 Language and Libraries: The Revised Report. Cambridge, UK: Cambridge University Press.Google Scholar
Reynolds, J. C. (1983) Types, abstraction and parametric polymorphism. In Proceedings of Information Processing. Elsevier, pp. 513–523.Google Scholar
Strachey, C. (2000) Fundamental Concepts in Programming Languages. Lecture notes for a course at the International Summer School in Computer Programming, 1967. Reprint appeared in Higher-Order Symb. Comput. 13 (1–2), 11–49.Google Scholar
Voigtländer, J. (2009) Bidirectionalization for free! In Proceedings of Principles of Programming Languages. ACM Press, pp. 165–176.Google Scholar
Voigtländer, J. (2012) Ideas for connecting inductive program synthesis and bidirectionalization. In Proceedings of Partial Evaluation and Program Manipulation. ACM Press, pp. 39–42.Google Scholar
Voigtländer, J., Hu, Z., Matsuda, K. & Wang, M. (2010) Combining syntactic and semantic bidirectionalization. In Proceedings of the International Conference on Functional Programming. ACM Press, pp. 181–192.Google Scholar
Wadler, P. (1989) Theorems for free! In Proceedings of Functional Programming Languages and Computer Architecture. ACM Press, pp. 347–359.Google Scholar
Wadler, P. (1990) Deforestation: Transforming programs to eliminate trees. Theor. Comput. Sci. 73 (2), 231–248.CrossRefGoogle Scholar
Wadler, P. (1992) The essence of functional programming (Invited talk). In Proceedings of Principles of Programming Languages. ACM Press, pp. 1–14.Google Scholar
Wang, M., Gibbons, J., Matsuda, K. & Hu, Z. (2013) Refactoring pattern matching. Sci. Comput. Program. 78 (11), 2216–2242.CrossRefGoogle Scholar
Wang, M., Gibbons, J. & Wu, N. (2011) Incremental updates for efficient bidirectional transformations. In Proceedings of the International Conference on Functional Programming. ACM Press, pp. 392–403.Google Scholar
Submit a response

Discussions

No Discussions have been published for this article.