How to replace failure by a list of successes a method for exception handling, backtracking, and pattern matching in lazy functional languages
- 1 January 1985
- book chapter
- Published by Springer Nature
- p. 113-128
- https://doi.org/10.1007/3-540-15975-4_33
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A higher-order implementation of rewritingScience of Computer Programming, 1983
- The Evaluation of Expressions in IconACM Transactions on Programming Languages and Systems, 1982
- Recursion Equations as a Programming LanguagePublished by Springer Nature ,1982
- Experience with an applicative string processing languagePublished by Association for Computing Machinery (ACM) ,1980
- Algorithm = logic + controlCommunications of the ACM, 1979
- Edinburgh LCFLecture Notes in Computer Science, 1979
- A lazy evaluatorPublished by Association for Computing Machinery (ACM) ,1976
- New Programming Languages for Artificial Intelligence ResearchACM Computing Surveys, 1974