Pattern-driven Reduction in Haskell. Harrison, W. & Kieburtz, R. In 2nd International Workshop on Reduction Strategies in Rewriting and Programming (WRS02), Copenhagen, Denmark, 2002.
Pattern-driven Reduction in Haskell [pdf]Paper  abstract   bibtex   
Haskell is a functional programming language with nominally non-strict semantics, implying that evaluation of a Haskell expression proceeds by demand-driven reduction. However, Haskell also provides pattern matching on arguments of functions, in \bf let expressions and in the match clauses of \bf case expressions. Pattern-matching requires data-driven reduction to the extent necessary to evaluate a pattern match or to bind variables introduced in a pattern. In this paper we provide both an abstract semantics and a logical characterization of pattern-matching in Haskell and the reduction order that it entails.

Downloads: 0