[1] : The Free On-line Dictionary of Computing (27 SEP 03)

constant applicative form
     
        caf functional programming a supercombinator which is
        not a lambda abstraction.  this includes truly constant
        expressions such as 12, + 1 2, 1,2,3 as well as partially
        applied functions such as + 4.  note that this last example
        is equivalent under eta abstraction to \ x . + 4 x which is
        not a caf.
     
        since a caf is a supercombinator, it contains no free
        variables.  moreover, since it is not a lambda abstraction it
        contains no variables at all.  it may however contain
        identifiers which refer to other cafs, e.g.
     
        	c 3 where c =  2.
     
        a caf can always be lifted to the top level of the program.
        it can either be compiled to a piece of graph which will be
        shared by all uses or to some shared code which will overwrite
        itself with some graph the first time it is evaluated.  a caf
        such as
     
        	ints = from 1  where  from n = n : from n+1
     
        can grow without bound but may only be accessible from within
        the code of one or more functions.  in order for the garbage
        collector to be able to reclaim such structures, we associate
        with each function a list of the cafs to which it refers.
        when garbage collecting a reference to the function we collect
        the cafs on its list.
     
        1994-11-30
     
     
see also:
supercombinator lambda abstraction eta abstraction garbage collector 

Applicative >> A Words
Applicative, definition of term: Applicative
applicative_pag1.html

Combining Form >> C Words
Combining Form, definition of term: Combining Form
combining+form_pag1.html

Art Form >> A Words
Art Form, definition of term: Art Form
art+form_pag1.html