Lambda calculus with patterns

Abstract

The -calculus is an extension of the -calculus with a pattern matching facility. The form of the argument of a function can be speci ed and hence -calculus is more convenient than ordinary -calculus. We explore the basic theory of -calculus, establishing results such as con uence. In doing so, we nd some requirements for patterns that guarantee con uence. Our work can be seen as giving some foundations for implementations of functional programming languages.

DOI: 10.1016/j.tcs.2008.01.019

Extracted Key Phrases

1 Figure or Table

Statistics

0510'06'07'08'09'10'11'12'13'14'15'16'17
Citations per Year

52 Citations

Semantic Scholar estimates that this publication has 52 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Klop2008LambdaCW, title={Lambda calculus with patterns}, author={Jan Willem Klop and Vincent van Oostrom and Roel C. de Vrijer}, journal={Theor. Comput. Sci.}, year={2008}, volume={398}, pages={16-31} }