[PDF][PDF] Recursive pattern matching on concrete data types
P Jouvelot, B Dehbonei - ACM Sigplan Notices, 1989 - dl.acm.org
P Jouvelot, B Dehbonei
ACM Sigplan Notices, 1989•dl.acm.orgThe functional programming model favors recursive definitions of functions by structural
induction over user-defined concrete data types. Most functional languages (eg, Lisp, ML,
Miranda, Haskell) offer powerful programming constructs that ease the writing of programs
based on this idea; destructuring let, mult ipl e-value-bind,... We propose an extension to the
usual notion of pattern-matching, called Recursive Pattern Matching. Our motivation is
based on the observation that most real-life data types are recursive, eg abstract syntax …
induction over user-defined concrete data types. Most functional languages (eg, Lisp, ML,
Miranda, Haskell) offer powerful programming constructs that ease the writing of programs
based on this idea; destructuring let, mult ipl e-value-bind,... We propose an extension to the
usual notion of pattern-matching, called Recursive Pattern Matching. Our motivation is
based on the observation that most real-life data types are recursive, eg abstract syntax …
The functional programming model favors recursive definitions of functions by structural induction over user-defined concrete data types. Most functional languages (eg, Lisp, ML, Miranda, Haskell) offer powerful programming constructs that ease the writing of programs based on this idea; destructuring let, mult ipl e-value-bind,...
We propose an extension to the usual notion of pattern-matching, called Recursive Pattern Matching. Our motivation is based on the observation that most real-life data types are recursive, eg abstract syntax trees, control graphs,... Consequently, many functions that manipulate these data types are recursive. The RPM technique combines pattern-based dispatching and recursive function calls on subcomponents of complex values.
ACM Digital LibraryShowing the best result for this search. See all results