OnlineWoerterBuecher.de
Internes

Lexikon


call-by-need


A reduction strategy which delays evaluation of function arguments until they are needed because they are arguments to a primitive function or a conditional. Call-by-need is one part of lazy evaluation. The term first appears in Chris Wadsworth' s thesis "Semantics and Pragmatics of the Lambda calculus" (Oxford, 1971, p. 183). It was used later, by J. Vuillemin in his thesis (Stanford, 1973). (1995-05-27)

In addition suitable contents:
[ 2 ] [ = ] [ ad ] [ ag ] [ al ] [ am ] [ an ] [ app ] [ ar ] [ arc ] [ arg ] [ argument ] [ as ] [ at ] [ au ] [ az ] [ b ] [ bd ] [ be ] [ by ] [ C ] [ ca ] [ Ch ] [ ch ] [ co ] [ con ] [ cu ] [ de ] [ du ] [ ec ] [ ed ] [ edu ] [ ee ] [ eg ] [ er ] [ es ] [ evaluation ] [ fi ] [ file ] [ fo ] [ for ] [ function ] [ gm ] [ gu ] [ gy ] [ h ] [ hr ] [ id ] [ il ] [ in ] [ io ] [ ir ] [ is ] [ it ] [ J ] [ la ] [ lazy evaluation ] [ lc ] [ Lex ] [ lu ] [ ma ] [ man ] [ mo ] [ mod ] [ module ] [ na ] [ nc ] [ ne ] [ nf ] [ O ] [ Ox ] [ pa ] [ pe ] [ ph ] [ pr ] [ primitive ] [ query ] [ rc ] [ re ] [ reduction ] [ reduction strategy ] [ S ] [ se ] [ si ] [ st ] [ T ] [ th ] [ to ] [ tr ] [ ua ] [ um ] [ us ] [ V ] [ va ] [ ve ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (4018 Reads)

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

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