Searching entangled program spaces
Searching entangled program spaces
复制标题
搜索纠缠的程序空间
DOI:
10.1145/3547622
复制
发表时间:
2022
影响因子:
--
通讯作者:
Polikarpova, Nadia
中科院分区:
文献类型:
--
作者:
Koppel, James;Guo, Zheng;de Vries, Edsko;Solar-Lezama, Armando;Polikarpova, Nadia
Many problem domains, including program synthesis and rewrite-based optimization, require searching astronomically large spaces of programs. Existing approaches often rely on building specialized data structures—version-space algebras, finite tree automata, or e-graphs—to compactly represent such spaces. At their core, all these data structures exploit independence of subterms; as a result, they cannot efficiently represent more complex program spaces, where the choices of subterms are entangled.We introduceequality-constrained tree automata(ECTAs), a new data structure, designed to compactly represent large spaces of programs with entangled subterms. We present efficient algorithms for extracting programs from ECTAs, implemented in a performant Haskell library, ecta. Using the ecta library, we construct Hectare, a type-driven program synthesizer for Haskell. Hectare significantly outperforms a state-of-the-art synthesizer Hoogle+—providing an average speedup of 8×—despite its implementation being an order of magnitude smaller.
登录
查看更多内容
影响因子:
1.3
作者:
E. V. Wyk;Derek Bodin;Jimin Gao;Lijesh Krishnan
通讯作者:
Lijesh Krishnan
影响因子:
--
作者:
Xinyu Wang;Işıl Dillig;Rishabh Singh
通讯作者:
Xinyu Wang;Işıl Dillig;Rishabh Singh
影响因子:
--
作者:
Guo, Zheng;James, Michael;Justo, David;Zhou, Jiaxiao;Wang, Ziteng;Jhala, Ranjit;Polikarpova, Nadia
通讯作者:
Polikarpova, Nadia
影响因子:
--
作者:
Xinyu Wang;Işıl Dillig;Rishabh Singh
通讯作者:
Rishabh Singh
DOI:
--
发表时间:
1999
期刊:
Foundations of Software Science and Computation Structure
影响因子:
--
作者:
B. Bogaert;Franck Seynhaeve;S. Tison
通讯作者:
S. Tison