Pattern Matching and Its Restrictions in Functional Languages


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 6, No. 5, pp. 1291-1295, May. 1999
10.3745/KIPSTE.1999.6.5.1291,   PDF Download:

Abstract

Modem functional languages provide some forms of pattern matching capability in them. However, these forms are on an ad-hoc basis and vary from languages to languages, making the user hard to understand the feature. To overcome this problem, we present a systematic approach to adding pattern matching to functional languages. We extend to the core functional language with pattern matching capability and illustrate several examples of the language. We also discuss how to extend the pattern matching capability to higher-order terms.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
K. K. Hang, J. Y. Chan, S. H. Sam, "Pattern Matching and Its Restrictions in Functional Languages," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 6, no. 5, pp. 1291-1295, 1999. DOI: 10.3745/KIPSTE.1999.6.5.1291.

[ACM Style]
Kwon Kee Hang, Ju Yae Chan, and Shin Hyun Sam. 1999. Pattern Matching and Its Restrictions in Functional Languages. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 6, 5, (1999), 1291-1295. DOI: 10.3745/KIPSTE.1999.6.5.1291.