Bounded quantification is undecidable
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Safe type checking in a statically-typed object-oriented programming language
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Object-oriented programming without recursive types
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Safe and decidable type checking in an object-oriented language
OOPSLA '93 Proceedings of the eighth annual conference on Object-oriented programming systems, languages, and applications
Complexity of kernel Fun subtype checking
Proceedings of the first ACM SIGPLAN international conference on Functional programming
Modeling inheritance as coercion in a symbolic computation system
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
An Interpretation of Extensible Objects
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Intersection types and bounded polymorphism
Mathematical Structures in Computer Science
| Hi-index | 0.00 |