terminology

[Iavor S. Diatchki]

hi,

Richard Uhtenwoldt wrote:
 > ...
> now Haskell is an applicative language in which every expression
> has a value.  the value of the expression
> 
>    return 3
> 
> is unprintable.  it is a newtype whose representation is a function.
i sometimes call values of "monadic type" computations.  so i would say 
that a value of type "StateTrans s a" is a computation which will 
produce a result of type a, but it may also depend on, and modify the 
state (of type s).

so in "return 3" i would say that 3 is the result of the computation.

bye
iavor

-- 
==================================================
| Iavor S. Diatchki, Ph.D. student               |
| Department of Computer Science and Engineering |
| School of OGI at OHSU                          |
| http://www.cse.ogi.edu/~diatchki               |
==================================================