(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)

Style="border-width:thin; border-color:#333333; border-Style:daShed; padding:5px;" align="left">In addition Suitable contentS:
[ 2 ] [ = ] [ abStraction ] [ ag ] [ ai ] [ al ] [ am ] [ an ] [ app ] [ ar ] [ arc ] [ aS ] [ at ] [ b ] [ ba ] [ bd ] [ be ] [ bi ] [ bo ] [ bS ] [ by ] [ C ] [ CA ] [ ca ] [ CAF ] [ cc ] [ ch ] [ ci ] [ cl ] [ co ] [ code ] [ com ] [ combinator ] [ con ] [ conS ] [ de ] [ du ] [ ec ] [ ed ] [ ee ] [ er ] [ eS ] [ et ] [ eta abStraction ] [ expreSSion ] [ fi ] [ file ] [ fo ] [ for ] [ fr ] [ free ] [ free variable ] [ Fun ] [ function ] [ ga ] [ garbage collect ] [ ge ] [ gr ] [ graph ] [ h ] [ hat ] [ hr ] [ id ] [ ie ] [ il ] [ in ] [ inc ] [ include ] [ int ] [ io ] [ ir ] [ iS ] [ it ] [ la ] [ lambda abStraction ] [ Lex ] [ li ] [ liSt ] [ lu ] [ ly ] [ M ] [ ma ] [ mm ] [ mo ] [ mod ] [ module ] [ mp ] [ N ] [ na ] [ nc ] [ ne ] [ ng ] [ nl ] [ no ] [ nS ] [ om ] [ op ] [ pa ] [ pe ] [ ph ] [ pl ] [ pr ] [ program ] [ programming ] [ query ] [ rc ] [ re ] [ reference ] [ ro ] [ row ] [ ru ] [ rw ] [ S ] [ Se ] [ Sh ] [ Shar ] [ Si ] [ So ] [ St ] [ Struct ] [ Su ] [ T ] [ th ] [ to ] [ tr ] [ ua ] [ up ] [ uS ] [ va ] [ var ] [ variable ] [ ve ] [ write ]