publication . Preprint . 2020

The geometry of syntax and semantics for directed file transformations

Huntsman, Steve; Robinson, Michael;
Open Access English
  • Published: 14 Jan 2020
Abstract
We introduce a conceptual framework that associates syntax and semantics with vertical and horizontal directions in principal bundles and related constructions. This notion of geometry corresponds to a mechanism for performing goal-directed file transformations such as "eliminate unsafe syntax" and suggests various engineering practices.
Persistent Identifiers
Subjects
arXiv: Computer Science::Programming LanguagesComputer Science::Logic in Computer Science
free text keywords: Computer Science - Logic in Computer Science, Computer Science - Cryptography and Security
Download from
70 references, page 1 of 5

[1] nLab authors, “Relation between type theory and category theory.” http://ncatlab.org/, Jan. 2020.

[2] nLab authors, “Isbell duality.” http://ncatlab.org/, Jan. 2020.

[3] J. Phillips and I. Raeburn, “Crossed products by locally unitary automorphism groups and principal bundles,” Journal of Operator Theory, pp. 215-241, 1984.

[4] A. Connes, Noncommutative Geometry. Academic Press, 1994.

[5] S. Awodey and H. Forssell, “First-order logical duality,” Annals of Pure and Applied Logic, vol. 164, no. 3, pp. 319 - 348, 2013.

[6] Univalent Foundations Program, Homotopy Type Theory: Univalent Foundations of Mathematics. Univalent Foundations, 2013.

[7] J. Moeller and C. Vasilakopoulou, “Monoidal Grothendieck construction,” arXiv preprint arXiv:1809.00727, 2018.

[8] C. H. Bennett, “Logical reversibility of computation,” IBM Journal of Research and Development, vol. 17, no. 6, pp. 525-532, 1973.

[9] T. Toffoli, “Reversible computing,” in International Colloquium on Automata, Languages, and Programming, pp. 632-644, Springer, 1980.

[10] R. Kaarsgaard, The Logic of Reversible Computing: Theory and Practice. PhD thesis, University of Copenhagen, 2017.

[11] K. Morita, Theory of Reversible Computing. Springer, 2017.

[12] “Document management - Portable document format - Part 2: PDF 2.0,” standard, International Organization for Standardization, Geneva, Switzerland, July 2017.

[13] J. Whitington, PDF Explained. O'Reilly, 2011.

[14] J. Lacomis, P. Yin, E. J. Schwartz, M. Allamanis, C. L. Goues, G. Neubig, and B. Vasilescu, “DIRE: a neural approach to decompiled identifier naming,” arXiv preprint arXiv:1909.09029, 2019. [OpenAIRE]

[15] F. Zhang and E. H. D'Hollander, “Using hammock graphs to structure programs,” IEEE Transactions on Software Engineering, vol. 30, no. 4, pp. 231-245, 2004.

70 references, page 1 of 5
Abstract
We introduce a conceptual framework that associates syntax and semantics with vertical and horizontal directions in principal bundles and related constructions. This notion of geometry corresponds to a mechanism for performing goal-directed file transformations such as "eliminate unsafe syntax" and suggests various engineering practices.
Persistent Identifiers
Subjects
arXiv: Computer Science::Programming LanguagesComputer Science::Logic in Computer Science
free text keywords: Computer Science - Logic in Computer Science, Computer Science - Cryptography and Security
Download from
70 references, page 1 of 5

[1] nLab authors, “Relation between type theory and category theory.” http://ncatlab.org/, Jan. 2020.

[2] nLab authors, “Isbell duality.” http://ncatlab.org/, Jan. 2020.

[3] J. Phillips and I. Raeburn, “Crossed products by locally unitary automorphism groups and principal bundles,” Journal of Operator Theory, pp. 215-241, 1984.

[4] A. Connes, Noncommutative Geometry. Academic Press, 1994.

[5] S. Awodey and H. Forssell, “First-order logical duality,” Annals of Pure and Applied Logic, vol. 164, no. 3, pp. 319 - 348, 2013.

[6] Univalent Foundations Program, Homotopy Type Theory: Univalent Foundations of Mathematics. Univalent Foundations, 2013.

[7] J. Moeller and C. Vasilakopoulou, “Monoidal Grothendieck construction,” arXiv preprint arXiv:1809.00727, 2018.

[8] C. H. Bennett, “Logical reversibility of computation,” IBM Journal of Research and Development, vol. 17, no. 6, pp. 525-532, 1973.

[9] T. Toffoli, “Reversible computing,” in International Colloquium on Automata, Languages, and Programming, pp. 632-644, Springer, 1980.

[10] R. Kaarsgaard, The Logic of Reversible Computing: Theory and Practice. PhD thesis, University of Copenhagen, 2017.

[11] K. Morita, Theory of Reversible Computing. Springer, 2017.

[12] “Document management - Portable document format - Part 2: PDF 2.0,” standard, International Organization for Standardization, Geneva, Switzerland, July 2017.

[13] J. Whitington, PDF Explained. O'Reilly, 2011.

[14] J. Lacomis, P. Yin, E. J. Schwartz, M. Allamanis, C. L. Goues, G. Neubig, and B. Vasilescu, “DIRE: a neural approach to decompiled identifier naming,” arXiv preprint arXiv:1909.09029, 2019. [OpenAIRE]

[15] F. Zhang and E. H. D'Hollander, “Using hammock graphs to structure programs,” IEEE Transactions on Software Engineering, vol. 30, no. 4, pp. 231-245, 2004.

70 references, page 1 of 5
Any information missing or wrong?Report an Issue