Shortcut fusion rules for the derivation of circular and higher-order programs-Reference-Cited by-同舟云学术

Shortcut fusion rules for the derivation of circular and higher-order programs

Published:2011-06 Issue:1-2 Volume:24 Page:115-149
ISSN:1388-3690
Container-title:Higher-Order and Symbolic Computation
language:en
Short-container-title:Higher-Order Symb Comput

Author:

Pardo Alberto,Fernandes João Paulo,Saraiva João

Publisher

Springer Science and Business Media LLC

Subject

Computer Science Applications,Software

Link

http://link.springer.com/content/pdf/10.1007/s10990-011-9076-x.pdf

Reference42 articles.

1. Abramsky, S., Jung, A.: Domain theory. In: Handbook of Logic in Computer Science, pp. 1–168. Clarendon, Oxford (1994)

2. Baier, H., Kugler, D., Margraf, M.: Elliptic curve cryptography based on ISO 15946. Technical report, Federal Office for Information Security (2007)

3. Bird, R.: Using circular programs to eliminate multiple traversals of data. Acta Inform. 21, 239–250 (1984)

4. Prentice-Hall International Series in Computer Science;R. Bird,1997

5. Chitil, O.: Type-inference based deforestation of functional programs. Ph.D. thesis, RWTH Aachen (October 2000)

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Java Stream Fusion;Proceedings of the XXIII Brazilian Symposium on Programming Languages - SBLP 2019;2019

2. Watch Out for that Tree! A Tutorial on Shortcut Deforestation;Central European Functional Programming School;2019

3. Multiple intermediate structure deforestation by shortcut fusion;Science of Computer Programming;2016-12

4. Modular polymorphic defunctionalization;Computer Science and Information Systems;2014

5. A Visual DSL for the Certification of Open Source Software;Computational Science and Its Applications – ICCSA 2014;2014