Joo Hyung Seok, Kim Hong Eub, Yoo Weon Hee

The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 4, No. 3, pp. 846-858, Mar. 1997
10.3745/KIPSTE.1997.4.3.846,   PDF Download:

Abstract

Despite elegant semantics and a lot of features, pure functional programming language do not provide an efficient way of representing states. Many researches have been done to resolve the problem, however, another problem arises that it is hard to implement because of the complex type system and reduction rule. Therefore, the scheme which simplifies the reduction rule and maintains states efficiently needed to have the implementation effective. This paper proposes st-calculus, the execution model of a functional language with states, and proves that the proposed model satisfies the Church-Rosser theorem. It has simple reduction rules and the ability of representing states without compromizing the properties of pure functional languages. The expressiveness can be increased through this model, and the difficulties with implementation may be reduced by simplifying the reduction rules.

Statistics
Cite this article