메뉴 건너뛰기




Volumn 1145, Issue , 1996, Pages 349-365

Subtyping constrained types

Author keywords

[No Author keywords available]

Indexed keywords

STATIC ANALYSIS;

EID: 84957380942     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61739-6_52     Document Type: Conference Paper
Times cited : (61)

References (21)
  • 6
    • 84976664186 scopus 로고
    • A semantics of multiple inheritance
    • volume 173 of Lecture notes in Computer Science, Springer-Verlag
    • L. Cardelli. A semantics of multiple inheritance. In Semantics of Data Types, volume 173 of Lecture notes in Computer Science, pages 51 -67. Springer-Verlag, 1984.
    • (1984) Semantics of Data Types , pp. 51-67
    • Cardelli, L.1
  • 7
    • 49049127479 scopus 로고
    • Fundamental properties of infinite trees
    • B. Courcelle. Fundamental properties of infinite trees. Theoretical Computer Science, 25:95-169,1983.
    • (1983) Theoretical Computer Science , vol.25 , pp. 95-169
    • Courcelle, B.1
  • 8
    • 0003583253 scopus 로고
    • Technical Report CSL-90-1, XEROX Palo Alto Research Center, CSLPubs. parcøxerox. com
    • Pavel Curtis. Constrained quantification in polymorphic type analysis. Technical Report CSL-90-1, XEROX Palo Alto Research Center, CSLPubs. parcøxerox. com, 1990.
    • (1990) Constrained quantification in polymorphic type analysis
    • Curtis, P.1
  • 9
    • 0029463256 scopus 로고
    • Sound polymorphic type inference for objects
    • J. Eifrig, S. Smith, and V. Trifonov. Sound polymorphic type inference for objects. In OOPSLA '95, pages 169-184,1995.
    • (1995) OOPSLA '95 , pp. 169-184
    • Eifrig, J.1    Smith, S.2    Trifonov, V.3
  • 10
    • 19144363683 scopus 로고
    • Type inference for recursively constrained types and its application to OOP
    • volume 1 of Electronic Notes in Theoretical Computer Science. Elsevier
    • J. Eifrig, S. Smith, and V. Trifonov. Type inference for recursively constrained types and its application to OOP. In Proceedings of the 1995 Mathematical Foundations of Programming Semantics Conference, volume 1 of Electronic Notes in Theoretical Computer Science. Elsevier, 1995. http: //www. elsevier. nl/ locate/entcs/volumel. html.
    • (1995) Proceedings of the 1995 Mathematical Foundations of Programming Semantics Conference
    • Eifrig, J.1    Smith, S.2    Trifonov, V.3
  • 14
    • 0026971854 scopus 로고
    • Type inference in the presence of overloading, subtyping and recursive types
    • S. Kaes. Type inference in the presence of overloading, subtyping and recursive types. In ACM Conference on Lisp and Functional Programming, pages 193-204,1992.
    • (1992) ACM Conference on Lisp and Functional Programming , pp. 193-204
    • Kaes, S.1
  • 19
    • 0030246571 scopus 로고    scopus 로고
    • Constrained types and their expressiveness
    • September
    • Jens Palsberg and Scott Smith. Constrained types and their expressiveness. TOPLAS, 18(5), September 1996.
    • (1996) TOPLAS , vol.18 , Issue.5
    • Palsberg, J.1    Smith, S.2
  • 21
    • 0028732121 scopus 로고
    • Principal type schemes for functional programs with overloading and subtyping
    • Geoffrey S. Smith. Principal type schemes for functional programs with overloading and subtyping. Science of Computer Programming, 23, 1994.
    • (1994) Science of Computer Programming , pp. 23
    • Smith, G.S.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.