Lisp machine manual
Relations as semantic constructs in an object-oriented language
OOPSLA '87 Conference proceedings on Object-oriented programming systems, languages and applications
Efficient implementation of lattice operations
ACM Transactions on Programming Languages and Systems (TOPLAS)
A denotational semantics of inheritance and its correctness
OOPSLA '89 Conference proceedings on Object-oriented programming systems, languages and applications
A deductive method for entity-relationship modeling
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Aspects: extending objects to support multiple, independent roles
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
CLOStrophobia: its etiology and treatment
ACM SIGPLAN OOPS Messenger
Experimental classification facilities for Smalltalk
OOPSLA '92 conference proceedings on Object-oriented programming systems, languages, and applications
Finding least common ancestors in directed acyclic graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Deductive Entity Relationship Modeling
IEEE Transactions on Knowledge and Data Engineering
ECOOP '93 Proceedings of the 7th European Conference on Object-Oriented Programming
Lowest common ancestors in trees and directed acyclic graphs
Journal of Algorithms
SysObjC: C extension for development of object-oriented operating systems
Proceedings of the 3rd workshop on Programming languages and operating systems: linguistic support for modern operating systems
Lowest common ancestors in trees and directed acyclic graphs
Journal of Algorithms
| Hi-index | 0.00 |
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.