@InProceedings{Kahl-2004a,
  author = 	 {Wolfram Kahl},
  title = 	 {Basic Pattern Matching Calculi: A Fresh View on Matching Failure},
  crossref =  {FLOPS2004},
  pages = 	 {276--290},
  URL = {http://www.cas.mcmaster.ca/~kahl/Publications/Conf/Kahl-2004a.html},
  SpringerURL = {http://www.springerlink.com/link.asp?id=3jet4qgw1q2nu0a8},
  abstract = {We propose pattern matching calculi as a refinement
     of $\lambda$-calculus that integrates mechanisms appropriate for
     fine-grained modelling of non-strict pattern matching.

      Compared with the functional rewriting strategy
      usually employed to define the operational semantics of
      pattern matching in non-strict functional programming languages
      like Haskell or Clean, our pattern matching calculi
      achieve the same effects using simpler and more local rules.

      The main device is to embed into expressions
      the separate syntactic category of matchings;
      the resulting language naturally encompasses
      pattern guards and Boolean guards as special cases.

      By allowing a confluent reduction system and a normalising strategy,
      these pattern matching calculi provide a new basis for
      operational semantics of non-strict programming languages
      and also for implementations.}
}

@Proceedings{FLOPS2004,
  title = {Functional and Logic Programming, {Proceedings of FLOPS 2004, Nara, Japan, April 7--9, 2004}},
  booktitle = {Functional and Logic Programming, {Proceedings of FLOPS 2004}},
  year = 	 2004,
  editor =	 {Yukiyoshi Kameyama and Peter Stuckey},
  volume =	 {2998},
  series =	 LNCS,
  URL = {http://link.springer.de/link/service/series/0558/tocs/t2998.htm},
  publisher =	 Springer
}