Deriving a functional Knuth-Morris-Pratt algorithm by transformation

Masato Takeichi, Yoji Akama

研究成果: Article

4 引用 (Scopus)

抜粋

We show how a functional program for the Knuth-Morris-Pratt algorithm can be derived from a naive algorithm in a few transformation steps. Included also in an implementation technique for efficient memo-ization. The idea behind the transformation is simple but novel and specific to functional programming; we use partial parametrization of higher-order functions and memo-ization by data structures. Partial parametrization corresponds to precomputation, which is a common optimization technique in procedural programming, and memo-ization is similar to tabulation, which replaces an expensive computation by a simple table lookup. Mathematical reasoning is provided for the transformation rules.

元の言語English
ページ(範囲)522-528
ページ数7
ジャーナルJournal of information processing
13
発行部数4
出版物ステータスPublished - 1990 12 1
外部発表Yes

ASJC Scopus subject areas

  • Computer Science(all)

フィンガープリント Deriving a functional Knuth-Morris-Pratt algorithm by transformation' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用