linear function
A recursive function i s linear if it i s of the form f x = if p x then q x el se h f x where h i s a "linear functional" which mean s that (1) for all function s, a, b c and some function ht h (if a then b el se c) = if ht a then h b el se h c Function ht i s known a s the "predicate tran sformer" of h. (2) If for some x, h ( y . bottom) x /= bottom then for all g, ht g x = True. I.e. if h g x terminate s de spite g x not terminating then ht g x doe sn' t depend on g. see al so linear argument. (1995-02-15) style="border-width:thin; border-color:#333333; border-style:dashed; padding:5px;" align="left">In addition suitable contents: [ 2 ] [ = ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ arg ] [ argument ] [ as ] [ at ] [ b ] [ bo ] [ bot ] [ bottom ] [ ca ] [ cat ] [ ch ] [ cu ] [ de ] [ do ] [ du ] [ ec ] [ ed ] [ ee ] [ er ] [ es ] [ fi ] [ file ] [ fo ] [ for ] [ Fun ] [ function ] [ functional ] [ gu ] [ h ] [ hat ] [ hr ] [ ht ] [ id ] [ il ] [ in ] [ io ] [ is ] [ it ] [ kn ] [ Lex ] [ li ] [ line ] [ linear argument ] [ ls ] [ mo ] [ mod ] [ module ] [ na ] [ nc ] [ ne ] [ ng ] [ no ] [ ns ] [ om ] [ pe ] [ ph ] [ pr ] [ query ] [ rc ] [ re ] [ recursive ] [ ru ] [ s ] [ se ] [ si ] [ sn ] [ so ] [ T ] [ th ] [ to ] [ tr ] [ tt ] [ um ] [ ve ]
[ Go Back ]
Free On-line Dictionary of Computing Copyright © by OnlineWoerterBuecher.de - (2698 Reads) |