Inductive graphs and functional graph algorithms

Journal of Functional Programming

Volumn 11, Issue 5, 2001, Pages 467-492

  Erwig, Martin ^a  

^a Oregon State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035647171     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796801004075     Document Type: Article

References (39)

1. Aasa, A., Holström, S. and Nilsson, C. (1988) An Efficiency Comparison of Some Representations of Purely Functional Arrays. BIT, 28(3), 490-503.
2. Barendsen, E. and Smetsers, S. (1996) Uniqueness Typing for Functional Languages with Graph Rewriting Semantics. Mathematical Structures in Computer Science, 6, 579-612.
3. Bird, R. S. (1998) Introduction to Functional Programming Using Haskell. Prentice-Hall International.
4. Briggs, P. and Torczon, L. (1993) An Efficient Representation For Sparse Sets. ACM Letters on Programming Languages, 2(4), 59-69.
5. Burton, F. W. (1982) An Efficient Functional Implementation of FIFO Queues. Information Processing Letters, 14(5), 205-206.
6. Burton, F. W. and Cameron, R. D. (1993) Pattern Matching with Abstract Data Types. Journal of Functional Programming, 3(2), 171-190.
7. Burton, F. W. and Yang, H.-K. (1990) Manipulating Multilinked Data Structures in a Pure Functional Language. Software - Practice and Experience, 20(11), 1167-1185.
8. Chuang, T.-R. and Goldberg, B. (1993) Real-Time Deques, Multihead Turing Machines, and Purely Functional Programming. Conf. on Functional Programming and Computer Architecture, pp. 289-293.
9. Dietz, P. F. (1989) Fully Persistent Arrays. Workshop on Algorithms and Data Structures: Lecture Notes in Computer Science 382, pp. 67-74.
10. Erwig, M. (1992) Graph Algorithms = Iteration + Data Structures? The Structure of Graph Algorithms and a Corresponding Style of Programming. 18th Int. Workshop on Graph-Theoretic Concepts in Computer Science: Lecture Notes in Computer Science 657, pp. 277-292.
11. Erwig, M. (1996) Active Patterns. 8th Int. Workshop on Implementation of Functional Languages. LNCS 1268, pp. 21-40.
12. Erwig, M. (1997a) Fully Persistent Graphs - Which One to Choose? 9th Int. Workshop on Implementation of Functional Languages: Lecture Notes in Computer Science 1467, pp. 123-140.
13. Erwig, M. (1997b) Functional Programming with Graphs. 2nd ACM Int. Conf. on Functional Programming, pp. 52-65.
14. Erwig, M. (1998a) A Functional Homage to Graph Reduction. Technical Report 239, FernUniversität Hagen.
15. Erwig, M. (1998b) Abstract Syntax and Semantics of Visual Languages. J. Visual Languages and Computing, 9(5), 461-483.
16. Erwig, M. (2000) Random Access to Abstract Data Types. 8th Int. Conf. on Algebraic Methodology and Software Technology: Lecture Notes in Computer Science 1816, pp. 135-149.
17. Erwig, M. and Peyton Jones, S. L. (2000) Pattern Guards and Transformational Patterns. Haskell Workshop.
18. Fegaras, L. and Sheard, T. (1996) Revisiting Catamorphisms over Datatypes with Embedded Functions. 23rd ACM Symp. on Principles of Programming Languages, pp. 284-294.
19. Gibbons, J. (1995) An Initial Algebra Approach to Directed Acyclic Graphs. Mathematics of Program Construction: Lecture Notes in Computer Science 947, pp. 282-303.
20. Gries, D. (1981) The Science of Programming. Springer-Verlag.
21. Harrison, R. (1989) Abstract Data Types in Standard ML. Wiley.
22. Hood, R. and Melville, R. (1981) Real-Time Queue Operations in Pure List. Infor. Process. Lett. 13(2), 50-53.
23. Hudak, P. and Bloss, A. (1985) The Aggregate Update Problem in Functional Programming Systems. 12th ACM Symp. on Principles of Programming Languages, pp. 300-313.
24. Johnsson, T. (1998) Efficient Graph Algorithms Using Lazy Monolithic Arrays. J. Functional Programming, 8(4), 323-333.
25. Kashiwagi, Y. and Wise, D. (1991) Graph Algorithms in a Lazy Functional Programming Language. 4th Int. Symp. on Lucid and Intensional Programing, pp. 35-46.
26. King, D. J. (1996) Functional Programming and Graph Algorithms. PhD thesis, University of Glasgow.
27. King, D. J. and Launchbury, J. (1995) Structuring Depth-First Search Algorithms in Haskell. 22nd ACM Symp. on Principles of Programming Languages, pp. 344-354.
28. Launchbury, J. (1995) Graph Algorithms with a Functional Flavour. Advanced Functional Programing: Lecture Notes in Computer Science 925, pp. 308-331.
29. Okasaki, C. (1995) Simple and Efficient Purely Functional Queues and Deques. J. Functional Programming, 5(4), 583-592.
30. Okasaki, C. (1998) Purely Functional Data Structures. Cambridge University Press.
31. Okasaki, C. (2000) Breadth-First Numbering: Lessons from a Small Exercies in Algorithm Design. 5th ACM Int. Conf. on Functional Programming, pp. 131-136.
32. O'Neill, M. E. and Burton, F. W. (1997) A New Method for Functional Arrays. J. Functional Programming, 7(5), 487-513.
33. Palao Gostanza, P., Peña, R. and Núñez, M. (1996) A New Look at Pattern Matching in Abstract Data Types. 1st ACM Int. Conf. on Functional Programming, pp. 110-121.
34. Paulson, L. C. (1996) ML for the Working Programmer (2nd ed.). Cambridge University Press.
35. Rabhi, F. and Lapalme, G. (1999) Algorithms: A Functional Programming Approach. Addison-Wesley.
36. Reade, C. (1989) Elements of Functional Programming. Addison-Wesley.
37. Sastry, A., W., C. and Z., A. (1993) Order-of-Evaluation Analysis for Destructive Updates in Strict Functional Languages with Flat Aggregates. Conf. on Functional Programming and Computer Architecture.
38. Ullman, J. D. (1998) Elements of ML Programming (2nd ed.). Prentice-Hall International.
39. Wadler, P. (1987) Views: A Way for Pattern Matching to Cohabit with Data Abstraction. 14th ACM Symp. on Principles of Programming Languages, pp. 307-313.