OnlineWoerterBuecher.de
Internes

Lexikon


reduction strategy


An algorithm for deciding which redex(es) to reduce next. Different strategies have different termination properties in the presence of recursive functions or values. See string reduction, normal order reduction, {applicative order reduction}, {parallel reduction} (1995-05-09)

In addition suitable contents:
[ = ] [ al ] [ algorithm ] [ am ] [ app ] [ applicative order reduction ] [ ar ] [ arc ] [ at ] [ av ] [ ca ] [ cat ] [ ch ] [ ci ] [ cu ] [ D ] [ de ] [ dec ] [ diff ] [ ding ] [ du ] [ ec ] [ ed ] [ edu ] [ ee ] [ eg ] [ er ] [ es ] [ fi ] [ file ] [ fo ] [ for ] [ function ] [ gi ] [ h ] [ hm ] [ hr ] [ id ] [ ie ] [ iff ] [ il ] [ in ] [ io ] [ it ] [ Lex ] [ li ] [ lu ] [ ma ] [ mo ] [ mod ] [ module ] [ na ] [ nc ] [ ne ] [ ng ] [ no ] [ norm ] [ normal order reduction ] [ ns ] [ op ] [ pa ] [ parallel reduction ] [ pe ] [ ph ] [ pl ] [ pr ] [ query ] [ rc ] [ re ] [ recursive ] [ redex ] [ reduction ] [ ro ] [ S ] [ se ] [ si ] [ st ] [ string ] [ string reduction ] [ th ] [ theory ] [ to ] [ tr ] [ va ] [ value ] [ ve ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (3870 Reads)

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

Page Generation in 0.0891 Seconds, with 16 Database-Queries
Zurück zur Startseite