Predicate dispatching: A unified theory of dispatch

Download: PDF, PostScript, slides (PDF), slides (PostScript), implementation, manual.

“Predicate dispatching: A unified theory of dispatch” by Michael D. Ernst, Craig S. Kaplan, and Craig Chambers. In ECOOP '98, the 12th European Conference on Object-Oriented Programming, (Brussels, Belgium), July 20-24, 1998, pp. 186-211.

Abstract

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.

Download: PDF, PostScript, slides (PDF), slides (PostScript), implementation, manual.

BibTeX entry:

@inproceedings{ErnstKC98,
   author = {Michael D. Ernst and Craig S. Kaplan and Craig Chambers},
   title = {Predicate dispatching: A unified theory of dispatch},
   booktitle = {ECOOP '98, the 12th European Conference on Object-Oriented
	Programming},
   pages = {186--211},
   address = {Brussels, Belgium},
   month = {July~20-24,},
   year = {1998}
}

(This webpage was created with bibtex2web.)

Back to Michael Ernst's publications.