Functional Programming with Graphs

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 32, Issue 8, 1997, Pages 52-74

  Erwig, Martin ^a  

^a UNIVERSITY OF HAGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347877057     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/258949.258955     Document Type: Article

References (22)

1. Adam L. Buchsbaum and Robert E. Tarjan. Confluently persistent deques via data structural bootstrapping. Journal of Algorithms, 18(3):513-547, May 1995.
2. F. Warren Burton and Robert D. Cameron. Pattern matching with abstract data types. Journal of Functional Programming, 3(2):171-190, April 1993.
3. Tyng-Ruey Chuang and Benjamin Goldberg. Real-time deques, multihead Turing machines, and purely functional programming. In Conference on Functional Programming Languages and Computer Architecture, pages 289-298, June 1993.
4. Paul F. Dietz. Fully persistent arrays. In Workshop on Algorithms and Data Structures, volume 382 of LNCS, pages 67-74. Springer-Verlag, August 1989.
5. James R. Driscoll, Neil Sarnak, Daniel D. K. Sleator, and Robert E. Tarjan. Making data structures persistent. Journal of Computer and System Sciences, 38(1):86-124, February 1989.
6. James R. Driscoll, Daniel D. K. Sleator, and Robert E. Tarjan. Fully persistent lists with catenation. Journal of the ACM, 41(5):943-959, September 1994.
7. Fritz Henglein. Type inference with polymorphic recursion. ACM Transactions on Programming Languages and Systems, 15(2):253-289, April 1993.
8. Robert Hood. The Efficient Implementation of Very-High-Level Programming Language Constructs. PhD thesis, Department of Computer Science, Cornell University, August 1982. (Cornell TR 82-503).
9. Robert Hood and Robert Melville. Real-time queue operations in pure Lisp. Information Processing Letters, 13(2):50-53, November 1981.
10. John Hughes. A novel representation of lists and its application to the function "reverse". Information Processing Letters, 22(3):141-144, March 1986.
11. Haim Kaplan and Robert E. Tarjan. Persistent lists with catenation via recursive slow-down. In ACM Symposium on Theory of Computing, pages 93-102, May 1995.
12. Haim Kaplan and Robert E. Tarjan. Purely functional lists with catenation via recursive slow-down. Draft revision of [11], August 1996.
13. Haim Kaplan and Robert E. Tarjan. Purely functional representations of catenable sorted lists. In ACM Symposium on Theory of Computing, pages 202-211, May 1996.
14. Alan Mycroft. Polymorphic type schemes and recursive definitions. In International Symposium on Programming, volume 167 of LNCS, pages 217-228. Springer-Verlag, April 1984.
15. Eugene W. Myers. Efficient applicative data types. In ACM Symposium on Principles of Programming Languages, pages 66-75, January 1984.
16. Chris Okasaki. Simple and efficient purely functional queues and deques. Journal of Functional Programming, 5(4):583-592, October 1995.
17. Chris Okasaki. Amortization, lazy evaluation, and persistence: Lists with catenation via lazy linking. In IEEE Symposium on Foundations of Computer Science, pages 646-654, October 1995.
18. Chris Okasaki. The role of lazy evaluation in amortized data structures. In ACM SlGPLAN International Conference on Functional Programming, pages 62-72, May 1996.
19. Chris Okasaki. Purely Functional Data Structures. PhD thesis, School of Computer Science, Carnegie Mellon University, September 1996.
20. Pedro Palao Gostanza, Ricardo Peña, and Manuel Núñez. A new look at pattern matching in abstract data types. In ACM SIGPLAN International Conference on Functional Programming, pages 110-121, May 1996.
21. Robert E. Tarjan. Amortized computational complexity. SIAM Journal on Algebraic and Discrete Methods, 6(2):306-318, April 1985.
22. Philip Wadler. Views: A way for pattern matching to cohabit with data abstraction. In ACM Symposium on Principles of Programming Languages, pages 307-313, January 1987.