Late binding




Late binding, dynamic binding, or dynamic linkage is a computer programming mechanism in which the method being called upon an object or the function being called with arguments is looked up by name at runtime.
With early binding, or static binding, in an object-oriented language, the compilation phase fixes all types of variables and expressions. This is usually stored in the compiled program as an offset in a virtual method table and is very efficient. With late binding the compiler does not read enough information to verify the method exists or bind its slot on the v-table. Instead the method is looked up by name at runtime.
The primary advantage of using late binding in Component Object Model programming is that it does not require the compiler to reference the libraries that contain the object at compile time. This makes the compilation process more resistant to version conflicts, in which the class's v-table may be accidentally modified.

History

The term "late binding" dates back to at least the 1960s, where it can be found in Communications of the ACM. The term was widely used to describe calling conventions in languages like Lisp, though usually with negative connotations about performance.
In the 1980s Smalltalk popularized object-oriented programming and with it late binding. Alan Kay once said, "OOP to me means only messaging, local retention, and protection and hiding of state-process, and extreme late-binding of all things. It can be done in Smalltalk and in LISP. There are possibly other systems in which this is possible, but I'm not aware of them."
In the early to mid-1990s, Microsoft heavily promoted its COM standard as a binary interface between different OOP programming languages. COM programming equally promoted early and late binding, with many languages supporting both at the syntax level.
In 2000, Alex Martelli coined the term "duck typing" to refer to a similar concept, but with a different emphasis. While late binding generally focuses on implementation details, duck typing focuses on the ability to ignore types and concentrate on the methods an object currently has.

Late binding implementations

Late binding in dynamically-typed object-oriented languages

In most dynamically-typed languages, the list of methods on an object can be altered at runtime. This requires late binding.

Late binding in Lisp

In Lisp. late bound global function calls are efficiently looked up at runtime via a symbol's function cell. These function bindings are mutable.
Example using an interactive Clozure Common Lisp session:

?
) ; a still undefined function BAR gets called
;Compiler warnings :
; In FOO: Undefined function BAR
FOO
? ; now we define it
)
BAR
? ; calling foo and it uses the recent definition of BAR
6.283185307179586D0
? ; now we redefine BAR
)
BAR
? ; FOO now calls the new function, there is no need to recompile/link/load FOO
3141.592653589793D0
? ; BAR is a symbol
SYMBOL
? ; the symbol BAR has a function binding

Late binding in C++

In C++, late binding refers to what normally happens when the virtual keyword is used in a method's declaration. C++ then creates a so-called virtual table, which is a look-up table for such functions that will always be consulted when they are called. Usually, the "late binding" term is used in favor of "dynamic dispatch".

Late binding in COM languages

In COM programming a late-bound method call is performed using the IDispatch interface. Some COM-based languages such as Visual Basic 6 have syntactical support for calling this interface. This is done by defining the variable's type as Object. Others such as C++ require that you explicitly call GetIDsOfNames to look up a method and Invoke to call it.

Late binding in .NET

In.NET, late binding refers to overriding a virtual method like C++ or implementing an interface. The compiler builds virtual tables for every virtual or interface method call which is used at run-time to determine the implementation to execute.
Also like COM and Java, the Common Language Runtime provides reflection APIs that can make late binding calls. The use of these calls varies by language.
With C# 4, the language also added the "dynamic" pseudo-type. This would be used in place of the Object type to indicate that late binding is desired. The specific late binding mechanism needed is determined at runtime using the Dynamic Language Runtime as a starting point.
Visual Basic uses them whenever the variable is of type Object and the compiler directive "Option Strict Off" is in force. This is the default setting for a new VB project. Prior to version 9, only.NET and COM objects could be late bound. With VB 10, this has been extended to DLR-based objects.

Late binding in Java

There are three definitions for late binding in Java.
Early documents on Java discussed how classes were not linked together at compile time. While types are statically checked at compile time, different implementations for classes could be swapped out just prior to runtime simply by overwriting the class file. As long as the new class definition had the same class and method names, the code would still work. In this sense it is similar to the traditional definition of late binding.
Currently, it is popular to use the term late binding in Java programming as a synonym for dynamic dispatch. Specifically, this refers to Java's single dispatch mechanism used with virtual methods.
Finally, Java can use late binding using its reflection APIs and type introspection much in the same way it is done in COM and.NET programming. Generally speaking those who only program in Java do not call this late binding. Likewise the use of "duck typing" techniques is frowned upon in Java programming, with abstract interfaces used instead.
Oracle, the current owner of Java, has been known to use the term late binding in the "duck typing" sense when discussing both Java and other languages in the same documentation.

Early vs. late binding in PL/SQL and Ada

When using early binding between Ada and a database-stored procedure, a timestamp is checked to verify that the stored procedure has not changed since the code was compiled. This allows for faster executions and prevents the application from running against the wrong version of a stored procedure.
When using late binding the timestamp check is not performed, and the stored procedure is executed via an anonymous PL/SQL block. While this can be slower, it removes the need to recompile all of the client applications when a stored procedure changes.
This distinction appears to be unique to PL/SQL and Ada. Other languages that can call PL/SQL procedures, as well as other database engines, only use late binding.

Criticism

Late binding has poorer performance than an early bound method call. Under most implementations the correct method address must be looked up by name with each call, requiring relatively expensive dictionary search and possibly overload resolution logic, yet it is generally negligible on modern computers.
For some compilers late binding may prevent the use of static type checking. When making a late bound call, the compiler has to assume that the method exists. This means a simple spelling error can cause a run-time error to be thrown. The exact exception varies by language, but it is usually named something like "Method Not Found" or "Method Missing". Modern compilers avoid this by ensuring that every possible call must have an implementation during compilation.
Late binding may prevent forms of static analysis needed by an integrated development environment. For example, an IDE's "go to definition" feature may not function on a late-bound call, if the IDE has no way to know which class the call may refer to. A modern IDE easily solves this especially for object-oriented languages since a late-bound method always specifies an interface or base class, which is where "go to definition" leads, and "find all references" can be used to find all implementations or overrides.
A similar problem is that possible lack of typing information may prevent the creation of dependency graphs. However, other programming methods such as abstract interfaces can result in the same problems. A modern IDE can create such dependency graphs as easily as it handles "find all references".