Monadic memoization towards correctness-preserving reduction of search

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2671, Issue , 2003, Pages 66-80

  Frost, Richard ^a  

^a UNIVERSITY OF WINDSOR   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS; ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER PROGRAMMING;

EQUATIONAL REASONING; FURTHER WORKS; MEMOIZATION; PROOF OF CORRECTNESS;

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL METHODS;

EQUATIONAL REASONING; MEMOIZATION; MEMOIZED PROGRAMS;

EID: 7044272248     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44886-1_8     Document Type: Conference Paper

References (23)

1. Augusteijn, L. (1993) Functional Programming, Program Transformations and Compiler Construction. Philips Research Laboratories. ISBN 90-74445-04-7.
2. Burge, W.H. (1975) Recursive Programming Techniques. Addison-Wesley Publishing Company, Reading, Massachusetts.
3. Fairburn, J. (1986)Mak ing form follow function: An exercise in functional programming style. University of Cambridge Computer Laboratory Technical Report No 89.
4. Field, A. J. and Harrison, P. G. (1988) Functional Programming. Addison-Wesley Publishing Company, Reading, Massachusetts.
5. Frost, R.A. (2002)W /AGE The Windsor Attribute Grammar Programming Environment. IEEE Symposia on Human Centric Computing Languages and Environments HCC’2002 96-99.
6. Frost, R.A. and Szydlowski, B. (1995)Mem oizing purely-functional top-down backtracking language processors. Science of Computer Programming” (27) 263-288.
7. Frost, R.A. (1993)‘Gu arded attribute grammars’.Software Practice and Experience. 23 (10)1139-1156.
8. Frost, R.A. (1992)Con structing programs as executable attribute grammars. The Computer Journal 35 (4)376-389.
9. Frost, R.A. and Launchbury, E. J. (1989)Con structing natural language interpreters in a lazy functional language’. The Computer Journal-Special edition on Lazy Functional Programming, 32 (2)108-121.
10. Hudak, P., Wadler, P., Arvind, Boutel, B., Fairbairn, J., Fasel, J., Hammond, K., Hughes, J., Johnsson, T., Kieburtz, D., Nikhil, R., Peyton Jones, S., Reeve, M., Wise, D. and Young, J. (1992)Report on the programming language Haskell, a non-strict, purely functional language, Version 1.2 ACM SIGPLAN Notices 27 (5).
11. Hughes, R. J.M. (1985)Lazy memo functions. In proceedings. Conference on Functional Programming and Computer Architecture Nancy, France, September 1985. Springer-Verlag Lecture Note Series 201, editors G. Goos and J. Hartmanis, 129-146.
12. Johnson, M. (1995)Squibs and Discussions: Memoization in top-down parsing. Computational Linguistics 21 (3)405-417.
13. Khoshnevisan, H. (1990)Efficient memo-table management strategies. Acta Informatica 28, 43-81.
14. Koskimies, K. Lazy recursive descent parsing for modular language implementation. Software Practice and Experience, 20 (8)749-772, 1990.
15. Leermakers, R. (1993) The Functional Treatment of Parsing. Kluwer Academic Publishers, ISBN 0-7923-9376-7.
16. Michie, D. (1968)‘Mem o’ functions and machine learning. Nature 218 19-22.
17. Moggi, E. (1989)Com putational lambda-calculus and monads. IEEE Symposium on Logic in Computer Science, Asilomar, California, June 1989, 14-23.
18. Norvig, P. (1991)Techniques for automatic memoisation with applications to context-free parsing. Computational Linguistics 17 (1)91-98.
19. Panitz (1996) Termination proofs for a lazy functional language by abstract interpretation. citeseer.nj.nec.com/panitz96termination.html
20. Turner, D. (1985)A lazy functional programming language with polymorphic types. Proc. IFIP Int. Conf. on Functional Programmiong Languages and Computer Architecture. Nancy, France. Springer Verlag Lecture Notes in Computer Science 201.
21. Wadler, P. (1985)How to replace failure by a list of successes, in P. Jouannaud (ed.) Functional Programming Languages and Computer Architectures Lecture Notes in Computer Science 201, Springer-Verlag, Heidelberg, 113.
22. Wadler, P. (1990)Com prehending monads. ACM SIGPLAN/SIGACT/SIGART Symposium on Lisp and Functional Programming, Nice, France, June 1990, 61-78.
23. Wadler, P. (1995)Mon ads for functional programming, Proceedings of the Bastad Spring School on Advanced Functional Programming, ed J. Jeuring and E. Meijer. Springer Verlag Lecture Notes in Computer Science 925.