Type inference and type containment.
Proc. of the international symposium on Semantics of data types
On understanding types, data abstraction, and polymorphism
ACM Computing Surveys (CSUR) - The MIT Press scientific computation series
A characterization of F-complete assignments
Theoretical Computer Science
Type theories, normal forms, and D∞-lambda-models
Information and Computation
Principal type scheme and unification for intersection type discipline
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Bounded quantifiers have interval models
LFP '88 Proceedings of the 1988 ACM conference on LISP and functional programming
Structural subtyping and the notion of power type
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Interfaces for strongly-typed object-oriented programming
OOPSLA '89 Conference proceedings on Object-oriented programming systems, languages and applications
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
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
An extension of standard ML modules with subtyping and inheritance
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
Semantics of programming languages: structures and techniques
Semantics of programming languages: structures and techniques
PER models of subtyping, recursive types and higher-order polymorphism
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Soft typing: an approach to type checking for dynamically typed languages
Soft typing: an approach to type checking for dynamically typed languages
Programming with intersection types and bounded polymorphism
Programming with intersection types and bounded polymorphism
Complete restrictions of the intersection type discipline
Theoretical Computer Science
A type system for prototyping languages
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A practical soft type system for Scheme
LFP '94 Proceedings of the 1994 ACM conference on LISP and functional programming
Bounded quantification is undecidable
Information and Computation
An extension of system F with subtyping
Information and Computation - Special conference issue: international conference on theoretical aspects of computer software
A modest model of records, inheritance, and bounded quantification
Theoretical aspects of object-oriented programming
Inheritance as implicit coercion
Theoretical aspects of object-oriented programming
Coherence of subsumption, minimum typing and type-checking in F≤
Theoretical aspects of object-oriented programming
Extensible records in a pure calculus of subtyping
Theoretical aspects of object-oriented programming
Intersection and union types: syntax and semantics
Information and Computation
Principal types and unification for simple intersection type systems
Information and Computation
Divergence of F≤ type checking
Theoretical Computer Science
What are principal typings and what are they good for?
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An interpretation of objects and object types
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
The Equivalence of Two Semantic Definitions for Inheritance in Object-Oriented Languages
Proceedings of the 7th International Conference on Mathematical Foundations of Programming Semantics
Subtyping + Extensionality: Confluence of beta-eta-top reduction in F
TACS '91 Proceedings of the International Conference on Theoretical Aspects of Computer Software
TACS '91 Proceedings of the International Conference on Theoretical Aspects of Computer Software
The Coherence of Languages with Intersection Types
TACS '91 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Singleton, Union and Intersection Types for Program Extraction
TACS '91 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Recursive Types Are not Conservative over F
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Relational Semantics for Recursive Types and Bounded Quantification
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
A Unifying Type-Theoretic Framework for Objects
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Towards a theory of type structure
Programming Symposium, Proceedings Colloque sur la Programmation
The simple semantics for Coppe-Dezani-Sallé types
Proceedings of the 5th Colloquium on International Symposium on Programming
Decidability of Higher-Order Subtyping with Intersection Types
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
PolyTOIL: A Type-Safe Polymorphic Object-Oriented Language
ECOOP '95 Proceedings of the 9th European Conference on Object-Oriented Programming
Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Typed compilation of inclusive subtyping
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Intersection types and computational effects
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Function types in complete type inference
Trends in functional programming
Enforcing Safety Properties Using Type Specialization
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
PADL '02 Proceedings of the 4th International Symposium on Practical Aspects of Declarative Languages
Verifying safety policies with size properties and alias controls
Proceedings of the 27th international conference on Software engineering
Essential language support for generic programming
Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation
Tool Support for Holistic Modelling of Distributed Embedded Systems in Creol
Electronic Notes in Theoretical Computer Science (ENTCS)
Union and intersection types for secure protocol implementations
TOSCA'11 Proceedings of the 2011 international conference on Theory of Security and Applications
Journal of Computer Security - Foundational Aspects of Security
| Hi-index | 0.00 |
Intersection types and bounded quantification are complementary extensions of a first-order programming language with subtyping. We define a typed λ-calculus combining these extensions, illustrate its unusual properties, and develop basic proof-theoretic and semantic results leading to algorithms for subtyping and typechecking.