Generating power of lazy semantics

Theoretical Computer Science

Volumn 187, Issue 1-2, 1997, Pages 203-219

  Karczmarczuk, Jerzy ^a  

^a NONE

Author keywords

Feynman diagrams; Functional; Haskell; Lazy; Series

Indexed keywords

ALGORITHMS; DATA STRUCTURES; ENCODING (SYMBOLS);

FEYNMAN DIAGRAMS; LAZY EVALUATION SCHEME;

COMPUTATIONAL LINGUISTICS;

EID: 0031269815     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00065-0     Document Type: Article

References (27)

1. H. Abelson, G.J. Sussman, Structure and Interpretation of Computer Programs, MIT Press, Cambridge, MA, 1984.
2. L. Allison, Circular programs and self-referential structures, Software Practice and Experience vol. 19(2) (1989) 99-109.
3. R.S. Bird, P. Wadler, Introduction to Functional Programming, Prentice-Hall, Englewood cliffs, NJ, 1988.
4. R.P. Brent, H.T. Kung, Fast algorithms for manipulating formal power series, J. ACM 25 (1978) 581-595.
5. W.H. Burge, Recursive Programming Techniques, Addison-Wesley, Reading, MA, 1975.
6. W.H. Burge, S.M. Watt, Infinite Structures in Scratchpad II, EUROCAL'87, Lecture Notes in Computer Science, vol. 378, pp. 138-148.
7. P. Cvitanovič, Field theory, Nordita Lecture Notes, 1983.
8. C. Domb, Graph theory and embeddings, in: C. Domb, M.S. Green, (Eds.), Phase Transitions and Critical Phenomena, Academic Press, New York, 1974, pp. 1-92.
9. B. Fuchssteiner et al., MuPAD Manual, Birkhäuser, Basel, 1995.
10. A.D. Gordon, A tutorial on co-induction and functional programming, Proc. 1994 Glasgow Workshop on Functional Programming, Ayr, Scotland, September, 1994.
11. R.W. Gosper, MIT AI Laboratory Memo 239, Hack 101, February, 1972, pp. 37-44.
12. R.E. Graham, Donald E. Knuth, Oren Patashnik, Concrete Mathematics, Addison-Wesley, Reading, MA, 1989.
13. D. Guntz, M. Monagan, Introduction to Gauss, Sigsam Bull. 28 (2) (1994) 3-19.
14. P. Hudak, S.P. Jones, P. Wadler et al., Report on the programming language Haskell (Version 1.3), Tech. Report Yale University/Glasgow University, 1996.
15. M.P. Jones, Gofer, Functional Programming Environment (1991). Unpublished documentation of the Gofer language. Available from: ftp://ftp.cs.nott.ac.uk/nott-fp/languages/gofer.
16. J. Karczmarczuk, Functional programming and mathematical objects, Functional Programming Languages in Education, FPLE '95, Lecture Notes in Computer Science, vol. 1022, Springer, Berlin, 1995, pp. 121-137.
17. D.E. Knuth, The art of computer programming, Seminumerical Algorithms, vol. 2, Addison-Wesley, Reading, MA, 1981.
18. H.T. Kung, J.F. Traub, J. ACM 25 (1978) 245-260.
19. J.D. Lipson, Newton's method: a great algebraic algorithm, Proc. ACM Symp. on Symbolic and Algebraic Computation 1976, pp. 260-270.
20. M.D. McIlroy, Squinting at power series, Software - Practice and Experience 20 (1990) 661-683.
21. S. Moritsugu, N. Inada, E. Goto, Symbolic Newton iteration and its applications, Symbolic and Algebraic Computations by Computers, World Scientific, Singapore, 1985, pp. 105-117.
22. P. Nogueira, Automatic feynman graph generation, J. Comput. Phys. 105 (1993) 279-289.
23. N. Perry, Hope+, Technical Report IC/FPR/LANG/2.5.1/7, Imperial College, 1987.
24. D.A. Turner, Elementary strong functional programming, Proc. Functional Programming Languages in Education (FPLE '95), Nijmegen, Lecture Notes in Computer Science, vol. 1022, Springer, Berlin, pp. 1-13.
25. J.S. Vitter, P. Flajolet, Average-case analysis of algorithms and data structures, in: Jan Van Leeuven, (Ed.), Algorithms and Complexity, Elsevier, Amsterdam, 1990, pp. 431-520.
26. J. Vuillemin, Exact real computer arithmetic with continued fractions, IEEE Trans. Comput. 39(8) 1990 1087-1105.
27. R. Zippel, Effective Polynomial Computation, Kluwer Academic Publishers, Boston, 1993.