Monadification of functional programs
By: Martin Erwig and Deling Ren.
Contributors: Ren, Deling.; Oregon State University. Dept. of Computer Science.
Series: Technical report -- TR02-60-10.; Technical report (Oregon State University. Dept. of Computer Science) -- 02-60-10.
Publisher: Oregon State University, Dept. of Computer Science
Published: 2002
Place of publication: [Corvallis, OR]
Language: eng
Number of pages: 19
Description: The structure of monadic functional programs allows the integration of many different features into such programs by just changing the definition of the monad and not the program, which is a desirable feature from a software engineering and maintenance point of view.  We describe an algorithm for the automatic transformation of a function into such a monadic form.  We argue that the proposed transformation is sound and under certain conditions also complete.  We also show how invertible monads can be used to extend the scope of the proposed transformation and can help to prevent the proliferation of monads over a program.
Notes: Caption title.

"October 2002."

Includes bibliographical references (leaves 19).

Also available on the World Wide Web.