Structural recursion for querying ordered graphs.


https://doi.org/10.1145/2500365.2500608
@inproceedings{DBLP:conf/icfp/HidakaAHKN13, author = {Soichiro Hidaka and Kazuyuki Asada and Zhenjiang Hu and Hiroyuki Kato and Keisuke Nakano}, editor = {Greg Morrisett and Tarmo Uustalu}, title = {Structural recursion for querying ordered graphs}, booktitle = {{ACM} {SIGPLAN} International Conference on Functional Programming, ICFP'13, Boston, MA, {USA} - September 25 - 27, 2013}, pages = {305--318}, publisher = {{ACM}}, year = {2013}, url = {https://doi.org/10.1145/2500365.2500608}, doi = {10.1145/2500365.2500608}, timestamp = {Tue, 06 Nov 2018 16:59:24 +0100}, biburl = {https://dblp.org/rec/conf/icfp/HidakaAHKN13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }

本页面没有标签
本页面最近更新:2020/05/21更新历史
发现错误?想一起完善? 在 GitHub 上编辑此页!
本页面的全部内容在 CC BY-SA 4.0 SATA 协议之条款下提供,附加条款亦可能应用

Copyright © 2016 - 2020 PKU Scholar

最近更新: 52aade4, 2020-05-21