OnlineWoerterBuecher.de
Internes

Lexikon


binding-time analysis


An analysis to identify sub-expressions which can be evaluated at compile-time or where versions of a function can be generated and called which are specialised to certain values of one or more arguments. See partial evaluation. (1995-03-28)

In addition suitable contents:
[ 2 ] [ = ] [ ai ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ arg ] [ argument ] [ at ] [ b ] [ be ] [ ca ] [ ch ] [ ci ] [ co ] [ com ] [ compiler ] [ de ] [ du ] [ ec ] [ ed ] [ ee ] [ er ] [ era ] [ es ] [ evaluation ] [ expression ] [ fi ] [ file ] [ function ] [ ge ] [ gen ] [ generate ] [ gu ] [ h ] [ hr ] [ id ] [ il ] [ in ] [ io ] [ is ] [ Lex ] [ li ] [ lu ] [ ly ] [ mo ] [ mod ] [ module ] [ mp ] [ na ] [ nc ] [ ne ] [ ns ] [ om ] [ pa ] [ partial evaluation ] [ pe ] [ ph ] [ pr ] [ query ] [ rc ] [ re ] [ S ] [ se ] [ si ] [ spec ] [ su ] [ to ] [ ua ] [ um ] [ va ] [ value ] [ ve ] [ version ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (3407 Reads)

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

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