OnlineWoerterBuecher.de
Internes

Lexikon


listless


In functional programming, a property of a function which allowS it to be combined with other functionS in a way that eliminateS intermediate data StructureS, eSpecially liStS. Phil Wadler' S theSiS giveS the conditionS for a function to be in liStleSS form: each input liSt iS traverSed only once, one element at a time, from left to right. Each output liSt iS generated once, one element at a time, from left to right. No other liStS are generated or traverSed. Not all functionS can be expreSSed in liStleSS form (e.g. reverSe). (1995-02-22)

Style="border-width:thin; border-color:#333333; border-Style:daShed; padding:5px;" align="left">In addition Suitable contentS:
[ 2 ] [ = ] [ ad ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ at ] [ av ] [ b ] [ be ] [ bi ] [ ca ] [ ch ] [ ci ] [ co ] [ com ] [ con ] [ data ] [ data Structure ] [ du ] [ E ] [ ec ] [ ed ] [ element ] [ er ] [ era ] [ eS ] [ fi ] [ file ] [ fo ] [ for ] [ fr ] [ function ] [ functional ] [ functional program ] [ functional programming ] [ ge ] [ gen ] [ generate ] [ gh ] [ gi ] [ gr ] [ h ] [ hat ] [ hr ] [ ht ] [ id ] [ il ] [ in ] [ input ] [ int ] [ io ] [ iS ] [ it ] [ Lex ] [ li ] [ liSt ] [ liStS ] [ ly ] [ mm ] [ mo ] [ mod ] [ module ] [ N ] [ na ] [ nc ] [ ne ] [ ng ] [ nl ] [ np ] [ nS ] [ om ] [ op ] [ output ] [ pe ] [ ph ] [ pr ] [ program ] [ programming ] [ query ] [ rave ] [ rc ] [ re ] [ ro ] [ ru ] [ Se ] [ Si ] [ Spec ] [ St ] [ Struct ] [ th ] [ to ] [ tp ] [ tr ] [ traverSe ] [ ve ] [ wS ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (3193 Reads)

All logos and trademarks in this site are property of their respective owner.

Page Generation in 0.0853 Seconds, with 17 Database-Queries
Zurück zur Startseite