Memoizing purely functional top-down backtracking language processors

Science of Computer Programming

Volumn 27, Issue 3, 1996, Pages 263-288

  Frost, Richard A ^a   Szydlowski, Barbara ^a  

^a UNIVERSITY OF WINDSOR   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GRAMMARS; COMPUTER PROGRAMMING LANGUAGES; FUNCTIONS; PROGRAMMING THEORY;

HIGHER ORDER FUNCTIONS; LANGUAGE PROCESSORS; MEMOIZATION; TOP DOWN BACKTRACKING PARSING;

PROGRAM PROCESSORS;

EID: 0030288798     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-6423(96)00014-7     Document Type: Article

References (22)

1. L. Augusteijn, Functional Programming, Program Transformations and Compiler Construction (Philips Research Laboratories, 1993).
2. W.H. Burge, Recursive Programming Techniques (Addison-Wesley, Reading, MA, 1975).
3. J. Earley, An efficient context-free parsing algorithm, Commun. ACM 13 (2) (1970) 94-102.
4. J. Fairburn, Making form follow function: An exercise in functional programming style, University of Cambridge Computer Laboratory Technical Report No. 89, 1986.
5. A.J. Field and P.G. Harrison, Functional Programming (Addison-Wesley, Reading, MA, 1988).
6. R.A. Frost, Constructing programs as executable attribute grammars, Comput. J. 35 (1992) 376-389.
7. R.A. Frost, W/AGE The Windsor Attribute Grammar Programming Environment, Schloss Dagstuhl International Workshop on Functional Programming in the Real World, 1995.
8. P. Hudak, P. Wadler, Arvind, B. Boutel, J. Fairbairn, J. Fasel, K. Hammond, J. Hughes, T. Johnsson, D. Kieburtz, R. Nikhil, S. Peyton Jones, M. Reeve, D. Wise and J. Young, Report on the programming language Haskell, a non-strict, purely functional language, Version 1.2, ACM SIGPLAN Notices 27 (5) (1992).
9. R.J.M. Hughes, Lazy memo functions, in: G. Goos and J. Hartmanis, eds., Proc. Conf. on Functional Programming and Computer Architecture, Nancy, France, September 1985, Springer Lecture Note Series, Vol. 201 (Springer, Berlin, 1985).
10. G. Hutton, Higher-order functions for parsing, J. Functional Programming 2(3) (1992) 323-343.
11. H. Khoshnevisan, Efficient memo-table management strategies, Acta Inform. 28 (1990) 43-81.
12. R. Leermakers, The Functional Treatment of Parsing (Kluwer Academic Publishers, Dordrecht, 1993).
13. H. Leiss, On Kilbury's modification of Earley's algorithm, ACM TOPLAS 12 (1990) 610-640.
14. D. Michie, 'Memo' functions and machine learning, Nature 218 (1968) 19-22.
15. E. Moggi, Computational lambda-calculus and monads, IEEE Symp. on Logic in Computer Science, Asilomar, Ca (June 1989) 14-23.
16. P. Norvig, Techniques for automatic memoisation with applications to context-free parsing, Computational Linguistics 17 (1) (1991) 91-98.
17. D. Turner, A lazy functional programming language with polymorphic types, Proc. IFIP Internat. Conf. on Functional Programmiong Languages and Computer Architecture. Nancy, France, Springer Lecture Notes in Computer Science, Vol. 201 (Springer, Berlin, 1985).
18. P. Wadler, How to replace failure by a list of successes, in: P. Jouannaud, ed. Functional Programming Languages and Computer Architectures, Lecture Notes in Computer Science, Vol. 201 (Springer, Heidelberg, 1985) 113.
19. P. Wadler, ed., Special issue on lazy functional programming, Comput. J. 32 (2) (1989).
20. P. Wadler, Comprehending monads, in: ACM SIGPLAN/SIGACT/SIGART Symp. on Lisp and Functional Programming, Nice, France (June 1990) 61-78.
21. P. Wadler, Monads for Functional Programming, Marktoberdorf Summer School on Program Design Calculi, Springer Lecture Notes in Computer Science, 1992.
22. P. Wadler, Monads for functional programming, in: J. Jeuring and E. Meijer eds., Proc. Bastad Spring School on Advanced Functional Programming, Springer Lecture Notes in Computer Science, Vol. 925 (Springer, Berlin, 1995).