Lazy State Evaluation of Process Functional Programs


The state of a system is expressed using PFL – a process functional language in an easily understandable manner. Coming out from monad and state transformers theory we define our concept of PFL variable environment. Then we introduce the style in which stateful systems are described using monads in pure lazy functional language Haskell. Finally, we describe briefly our approach to lazy state manipulation in PFL , as an inevitable basis for evaluating the efficiency of implementation of PFL for both sequential and parallel environments.


0 Figures and Tables

    Download Full PDF Version (Non-Commercial Use)