How to replace failure by a list of successes a method for exception handling, backtracking, and pattern matching in lazy functional languages

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

Volumn 201 LNCS, Issue , 1985, Pages 113-128

  Wadler, Philip ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER ARCHITECTURE; COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; PATTERN MATCHING;

EXCEPTION HANDLING; FUNCTIONAL LANGUAGES; LAZY EVALUATION; LAZY FUNCTIONAL LANGUAGES; TACTICALS;

FUNCTIONAL PROGRAMMING;

EID: 85034994733     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-15975-4_33     Document Type: Conference Paper

References (14)

1. Aho, A. V., and Ullman, J. D, Principles of Compiler Design. Addison-Wesley, 1977.
2. Black, A. P. Exception handling: the case against. D. Phil, dissertation, Oxford University, 1982. Also available as University of Washington technical report TR 82-01-02, 1982.
3. Bobrow, D. G., and Raphael, B. New programming languages for artificial intelligence research. Computing Surveys, 6(3): 155-174, September 1974.
4. Friedman, D. P., and Wise, D. S. Cons should not evaluate its arguments. In Michaelson and Milner (editors), Automata, Languages, and Programming, 257-284, Edinburgh University Press, 1976.
5. Gordon, M. J., Milner, R., and Wadsworth, C. P, Edinburgh LCP. Lecture Notes in Computer Science 78. Springer-Verlag, 1979.
6. Griswold, R. E. The evaluation of expressions in Icon. ACM Transactions on Programming Languages and Systems, 4(4): 563-584, October 1982.
7. Griswold, R. E. The evaluation of expressions in Icon. Symposium on Lisp and Functional Programming, ACM, Austin, TX, August 1984.
8. Henderson, P., and Morris, J. H. A lazy evaluator. In 3’rd Symposium on Principals of Programming Languages, 95-103, ACM, Atlanta, GA, 1976.
9. Henderson, P., Functional Programming: Application and Implementation. Prentice-Hall, 1980.
10. Kowalski, R. Algorithm = Logic + Control. Communications of the ACM, 22(7), July, 1979.
11. Morris, J. H., Schmidt, E., and Wadler, P. L., Experience with an applicative string processing language. 7’th Symposium on Principles of Programming Languages, ACM, Las Vegas, Nevada, 1980.
12. Rewriting in Cambridge LCF. Science of Computer Programming, 3: 119-149, Sept., 1983.
13. Turner, D. A. Recursion equations as a programming language. In Darlington, et al (editors), Functional Programming and Its Applications, Cambridge University Press, 1981.
14. Wadler, P. L. A splitting headache: Strict vs. lazy semantics for pattern matching in lazy functional languages. To appear.