Intersection types and computational effects
- 1 September 2000
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 35 (9), 198-208
- https://doi.org/10.1145/357766.351259
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- The subtyping problem for second-order types is undecidablePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Intersection types and bounded polymorphismMathematical Structures in Computer Science, 1997
- A refinement-type checker for standard MLPublished by Springer Science and Business Media LLC ,1997
- A typed intermediate language for flow-directed compilationPublished by Springer Science and Business Media LLC ,1997
- Simple imperative polymorphismHigher-Order and Symbolic Computation, 1995
- A Syntactic Approach to Type SoundnessInformation and Computation, 1994
- Polymorphism by name for references and continuationsPublished by Association for Computing Machinery (ACM) ,1993
- Inheritance as implicit coercionInformation and Computation, 1991
- Type inference for polymorphic referencesInformation and Computation, 1990
- Polymorphic type inference and containmentInformation and Computation, 1988