Proceedings of the 2023 ACM SIGPLAN International Workshop on Partial Evaluation and Program Manipulation最新文献

Towards a Reflection for Effect Handlers 面向效果处理程序的反射

Proceedings of the 2023 ACM SIGPLAN International Workshop on Partial Evaluation and Program Manipulation Pub Date : 2023-01-15 DOI: 10.1145/3571786.3573015

Youyou Cong, K. Asai

引用次数: 0

Efficient Embedding of Strategic Attribute Grammars via Memoization 基于记忆的策略属性语法高效嵌入

Proceedings of the 2023 ACM SIGPLAN International Workshop on Partial Evaluation and Program Manipulation Pub Date : 2023-01-15 DOI: 10.1145/3571786.3573019

José Nuno Macedo, Emanuel Rodrigues, Marcos Viera, João Saraiva

{"title":"Efficient Embedding of Strategic Attribute Grammars via Memoization","authors":"José Nuno Macedo, Emanuel Rodrigues, Marcos Viera, João Saraiva","doi":"10.1145/3571786.3573019","DOIUrl":"https://doi.org/10.1145/3571786.3573019","url":null,"abstract":"Strategic term re-writing and attribute grammars are two powerful programming techniques widely used in language engineering. The former relies on strategies to apply term re-write rules in defining large-scale language transformations, while the latter is suitable to express context-dependent language processing algorithms. These two techniques can be expressed and combined via a powerful navigation abstraction: generic zippers. This results in a concise zipper-based embedding offering the expressiveness of both techniques. Such elegant embedding has a severe limitation since it recomputes attribute values. This paper presents a proper and efficient embedding of both techniques. First, attribute values are memoized in the zipper data structure, thus avoiding their re-computation. Moreover, strategic zipper based functions are adapted to access such memoized values. We have implemented our memoized embedding as the Ztrategic library and we benchmarked it against the state-of-the-art Strafunski and Kiama libraries. Our first results show that we are competitive against those two well established libraries.","PeriodicalId":318756,"journal":{"name":"Proceedings of the 2023 ACM SIGPLAN International Workshop on Partial Evaluation and Program Manipulation","volume":"62 22","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113977258","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Symbolic Execution of Hadamard-Toffoli Quantum Circuits Hadamard-Toffoli量子电路的符号执行

Proceedings of the 2023 ACM SIGPLAN International Workshop on Partial Evaluation and Program Manipulation Pub Date : 2023-01-15 DOI: 10.1145/3571786.3573018

J. Carette, G. Ortiz, A. Sabry

{"title":"Symbolic Execution of Hadamard-Toffoli Quantum Circuits","authors":"J. Carette, G. Ortiz, A. Sabry","doi":"10.1145/3571786.3573018","DOIUrl":"https://doi.org/10.1145/3571786.3573018","url":null,"abstract":"The simulation of quantum programs by classical computers is a critical endeavor for several reasons: it provides proof-of-concept validation of quantum algorithms; it provides opportunities to experiment with new programming abstractions suitable for the quantum domain; and most significantly it is a way to explore the elusive boundary at which a quantum advantage may materialize. Here, we show that traditional techniques of symbolic evaluation and partial evaluation yield surprisingly efficient classical simulations for some instances of textbook quantum algorithms that include the Deutsch, Deutsch-Jozsa, Bernstein-Vazirani, Simon, Grover, and Shor's algorithms. The success of traditional partial evaluation techniques in this domain is due to one simple insight: the quantum bits used in these algorithms can be modeled by a symbolic boolean variable while still keeping track of the correlations due to superposition and entanglement. More precisely, the system of constraints generated over the symbolic variables contains all the necessary quantum correlations and hence the answer to the quantum algorithms. With a few programming tricks explained in the paper, quantum circuits with millions of gates can be symbolically executed in seconds. Paradoxically, other circuits with as few as a dozen gates take exponential time. We reflect on the significance of these results in the conclusion.","PeriodicalId":318756,"journal":{"name":"Proceedings of the 2023 ACM SIGPLAN International Workshop on Partial Evaluation and Program Manipulation","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134101529","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Semantic Transformation Framework for Rewriting Rules 改写规则的语义转换框架

Proceedings of the 2023 ACM SIGPLAN International Workshop on Partial Evaluation and Program Manipulation Pub Date : 2023-01-15 DOI: 10.1145/3571786.3573016

Jihee Park, Jaemin Hong, Sukyoung Ryu

{"title":"Semantic Transformation Framework for Rewriting Rules","authors":"Jihee Park, Jaemin Hong, Sukyoung Ryu","doi":"10.1145/3571786.3573016","DOIUrl":"https://doi.org/10.1145/3571786.3573016","url":null,"abstract":"Semantics-preserving source-to-source program transformations, such as optimization and refactoring, are essential for software development. Such transformations are often defined by rewriting rules describing which part of a program must be replaced with which subprogram. The main obstacle to designing a transformation is to prove its semantics preservation. Rewriting-rule-based frameworks alleviate this difficulty by giving proof guidelines or automating the proofs. Unfortunately, each framework is applicable to a restricted set of transformations due to a fixed definition of semantics preservation. Cousot and Cousot’s semantic transformation framework resolves this problem by leaving a space for its users to define a proper semantics preservation property. However, the framework does not exploit the characteristic of rewriting rules and fails to ease the proofs. In this work, we define a semantic transformation framework tailored to rewriting rules by refining Cousot and Cousot’s framework. Our framework facilitates modular proofs by providing syntax-directed guidelines and theorems that simplify proofs. We show the versatility of our framework by proving the semantics preservation of six well-known transformations.","PeriodicalId":318756,"journal":{"name":"Proceedings of the 2023 ACM SIGPLAN International Workshop on Partial Evaluation and Program Manipulation","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125807802","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Generating Programs for Polynomial Multiplication with Correctness Assurance 具有正确性保证的多项式乘法生成程序

Proceedings of the 2023 ACM SIGPLAN International Workshop on Partial Evaluation and Program Manipulation Pub Date : 2023-01-15 DOI: 10.1145/3571786.3573017

Ryohei Tokuda, Yukiyoshi Kameyama

引用次数: 1

Proceedings of the 2023 ACM SIGPLAN International Workshop on Partial Evaluation and Program Manipulation 2023年ACM SIGPLAN部分求值和程序操纵国际研讨会论文集

Proceedings of the 2023 ACM SIGPLAN International Workshop on Partial Evaluation and Program Manipulation Pub Date : 1900-01-01 DOI: 10.1145/3571786

引用次数: 0