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

1985/01/01 by Philip Wadler · 76 citations
Computer Science · Mathematics · #Advanced Software Engineering Methodologies #Backtracking #Computer science #Exception handling #Functional programming #Lazy evaluation #Logic, programming, and type systems #Matching (statistics) #Mathematics #Pattern matching #Programming language #Software Engineering Research #Term (time) #Theoretical computer science

paper · doi:10.1007/3-540-15975-4_33

published in Lecture Notes in Computer Science, 113-128 (Springer Berlin Heidelberg)

crossref issued 1985/01/01 · crossref published 1985/01/01 · crossref published-print 1985/01/01 · openalex publication_date 1985/01/01 · crossref published-online 2005/06/08 · crossref created 2012/02/25 · crossref deposited 2023/06/20 · openalex created_date 2025/10/10 · crossref indexed 2026/06/25 · openalex updated_date 2026/07/29

Citations

• Algorithm = logic + control
• A lazy evaluator

Cited by

• Parser Combinators for Ambiguous Left-Recursive Grammars
• Even higher-order functions for parsing or Why would anyone ever want to use a sixth-order function?
• Parser combinator [wikipedia]