Pure Pattern Calculus

@inproceedings{Jay2006PurePC,
  title={Pure Pattern Calculus},
  author={C. Barry Jay and Delia Kesner},
  booktitle={ESOP},
  year={2006}
}
The pure pattern calculus generalises the pure lambda-calculus by basing computation on pattern-matching instead of beta-reduction. The simplicity and power of the calculus derive from allowing any term to be a pattern. As well as supporting a uniform approach to functions, it supports a uniform approach to data structures which underpins two new forms of polymorphism. Path polymorphism supports searches or queries along all paths through an arbitrary data structure. Pattern polymorphism… CONTINUE READING