Predicate Dispatching: A Unified Theory of Dispatch

Predicate dispatching generalizes previous method dispatch mechanisms by permitting arbitrary predicates to control method applicability and by using logical implication between predicates as the overriding relationship. The method selected to handle a message send can depend not just on the classes of the arguments, as in ordinary object-oriented dispatch, but also on the classes of subcomponents, on an argument's state, and on relationships between objects. This simple mechanism subsumes and extends object-oriented single and multiple dispatch, ML-style pattern matching, predicate classes, and classifiers, which can all be regarded as syntactic sugar for predicate dispatching. This paper introduces predicate dispatching, gives motivating examples, and presents its static and dynamic semantics. An implementation of predicate dispatching is available.

• Type: Conference
• Year: 1998
• Where: ECOOP
• Authors: Michael D. Ernst, Craig S. Kaplan, Craig Chambers
• Keywords: ECOOP 1998, Method Dispatch Mechanisms, Predicate Classes, Predicate Dispatching, Programming Languages