Boolean Classes

15Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

Abstract

We extend the notion of class so that any Boolean combinations of classes is also a class. Boolean classes allow greater precision and conciseness in naming the class of objects governed a particular method. A class can be viewed as a predicate which is either true or false of any given object. Unlike predicates however classes have an inheritance hierarchy which is known at compile time. Boolean classes extend the notion of class, making classes more like predicates, while preserving the compile time computable inheritance hierarchy. © 1986, ACM. All rights reserved.

Cite

CITATION STYLE

APA

McAllester, D., & Zabih, R. (1986). Boolean Classes. ACM SIGPLAN Notices, 21(11), 417–423. https://doi.org/10.1145/960112.28740

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free