Breadth-First Traversal via Staging-Reference-Cited by-同舟云学术

Breadth-First Traversal via Staging

Published:2022 Issue: Volume: Page:1-33
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Gibbons Jeremy^ORCID,Kidney Donnacha Oisín^ORCID,Schrijvers Tom^ORCID,Wu Nicolas^ORCID

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-031-16912-0_1

Reference19 articles.

1. Bird, R., Gibbons, J., Mehner, S., Voigtländer, J., Schrijvers, T.: Understanding idiomatic traversals backwards and forwards. In: Haskell Symposium. ACM (2013). https://doi.org/10.1145/2503778.2503781

2. Bird, R.S.: Using circular programs to eliminate multiple traversals of data. Acta Informatica 21, 239–250 (1984). https://doi.org/10.1007/BF00264249

3. Capriotti, P., Kaposi, A.: Free applicative functors. In: Levy, P.B., Krishnaswami, N. (eds.) Mathematically Structured Functional Programming. EPTCS, vol. 153, pp. 2–30 (2014). https://doi.org/10.4204/EPTCS.153.2

4. Danvy, O., Thiemann, P., Zerny, I.: Circularity and lambda abstraction: from Bird to Pettorossi and back. In: Plasmeijer, R. (ed.) Implementation and Application of Functional Languages, p. 85. ACM (2013). https://doi.org/10.1145/2620678.2620687

5. Easterly, N.: Functions and newtype wrappers for traversing Trees: rampion/tree-traversals, January 2019. https://github.com/rampion/tree-traversals

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

1. A Monadic Framework for Name Resolution in Multi-phased Type Checkers;Proceedings of the 22nd ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences;2023-10-22

2. Phases in Software Architecture;Proceedings of the 1st ACM SIGPLAN International Workshop on Functional Software Architecture;2023-08-30

3. Modular Models of Monoids with Operations;Proceedings of the ACM on Programming Languages;2023-08-30