On understanding types, data abstraction, and polymorphism
ACM Computing Surveys (CSUR) - The MIT Press scientific computation series
Introduction to higher order categorical logic
Introduction to higher order categorical logic
A semantics of multiple inheritance
Information and Computation - Semantics of Data Types
Computational consequences and partial solutions of a generalized unification problem
Proceedings of the Fourth Annual Symposium on Logic in computer science
The semantics of second-order lambda calculus
Information and Computation
A modest model of records, inheritance, and unbounded quantification
Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Toward a typed foundation for method specialization and inheritance
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
F-bounded polymorphism for object-oriented programming
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Recursion over realizability structures
Information and Computation
Type systems for programming languages
Handbook of theoretical computer science (vol. B)
Handbook of theoretical computer science (vol. B)
Inheritance as implicit coercion
Information and Computation
A type-inference approach to reduction properties and semantics of polymorphic expressions (summary)
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Proceedings of the 5th International Conference on Mathematical Foundations of Programming Semantics
Relational Semantics for Recursive Types and Bounded Quantification
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
A Completeness Theorem for Recursively Defined Types
Proceedings of the 12th Colloquium on Automata, Languages and Programming
Polymorphic Type Schemes and Recursive Definitions
Proceedings of the 6th Colloquium on International Symposium on Programming
Polymorphic type inference and semiunification
Polymorphic type inference and semiunification
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
Decidable bounded quantification
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
Polymorphic lambda calculus and subtyping
Theoretical Computer Science
PolyTOIL: A type-safe polymorphic object-oriented language
ACM Transactions on Programming Languages and Systems (TOPLAS)
ECOOP '95 Proceedings of the 9th European Conference on Object-Oriented Programming
Typed operational semantics for higher-order subtyping
Information and Computation
Semantic types: a fresh look at the ideal model for types
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Intersection types and bounded polymorphism
Mathematical Structures in Computer Science
Higher-order subtyping and its decidability
Information and Computation
A new model construction for the polymorphic lambda calculus
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Subtyping object and recursive types logically
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
A design structure for higher order quotients
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
| Hi-index | 0.00 |