binding-time analysis

Computing Dictionary

binding-time analysis definition

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.
The Free On-line Dictionary of Computing, © Denis Howe 2010
Cite This Source
Previous Definition: binding-strake
Next Definition: bindle
More from
Synonyms and Antonyms for binding-time analysis
More from
Search for articles containing binding-time analysis Word FAQs presents 366 FAQs, incorporating some of the frequently asked questions from the past with newer queries.

Copyright © 2014, LLC. All rights reserved.
  • Please Login or Sign Up to use the Recent Searches feature