Extensible Pattern Matching in an Extensible Language

Computer Science – Programming Languages

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

Pattern matching is a widely used technique in functional languages, especially those in the ML and Haskell traditions, where it is at the core of the semantics. In languages in the Lisp tradition, in contrast, pattern matching it typically provided by libraries built with macros. We present match, a sophisticated pattern matcher for Racket, implemented as language extension. using macros. The system supports novel and widely-useful pattern-matching forms, and is itself extensible. The extensibility of match is implemented via a general technique for creating extensible language extensions.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Extensible Pattern Matching in an Extensible Language does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Extensible Pattern Matching in an Extensible Language, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Extensible Pattern Matching in an Extensible Language will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-112847

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.