메뉴 건너뛰기




Volumn 6, Issue 2, 2007, Pages 71-100

Just: Safe unknown types in Java-like languages

Author keywords

[No Author keywords available]

Indexed keywords


EID: 33847638485     PISSN: None     EISSN: 16601769     Source Type: Journal    
DOI: 10.5381/jot.2007.6.2.a4     Document Type: Conference Paper
Times cited : (11)

References (13)
  • 2
    • 33847685575 scopus 로고    scopus 로고
    • Davide Ancona, Giovanni Lagorio, and Elena Zucca. Type inference for polymorphic methods in Java-like languages. Technical report, Dipartimento di Informatica e Scienze dell'Informazione, Università di Geneva, October 2006.
    • Davide Ancona, Giovanni Lagorio, and Elena Zucca. Type inference for polymorphic methods in Java-like languages. Technical report, Dipartimento di Informatica e Scienze dell'Informazione, Università di Geneva, October 2006.
  • 3
    • 0029462709 scopus 로고
    • Subtypes vs. where clauses: Constraining parametric polymorphism
    • ACM Symp. on Object-Oriented Programming: Systems, Languages and Applications 1995, 10 of
    • Mark Day, Robert Gruber, Barbara Liskov, and Andrew C. Myers. Subtypes vs. where clauses: Constraining parametric polymorphism. In ACM Symp. on Object-Oriented Programming: Systems, Languages and Applications 1995, volume 30(10) of SIGPLAN Notices, pages 156-168, 1995.
    • (1995) SIGPLAN Notices , vol.30 , pp. 156-168
    • Day, M.1    Gruber, R.2    Liskov, B.3    Myers, A.C.4
  • 4
    • 0029463256 scopus 로고
    • Sound polymorphic type inference for objects
    • ACM Symp. on Object-Oriented Programming: Systems, Languages and Applications 1995, 10 of
    • Jonathan Eifrig, Scott F. Smith, and Valery Trifonov. Sound polymorphic type inference for objects. In ACM Symp. on Object-Oriented Programming: Systems, Languages and Applications 1995, volume 30(10) of SIGPLAN Notices, pages 169-184, 1995.
    • (1995) SIGPLAN Notices , vol.30 , pp. 169-184
    • Eifrig, J.1    Smith, S.F.2    Trifonov, V.3
  • 5
    • 19144363683 scopus 로고
    • Type inference for recursively constrained types and its application to OOP
    • Mathematical Foundations of Programming Semantics, of, Elsevier Science
    • Jonathan Eifrig, Scott F. Smith, and Valery Trifonov. Type inference for recursively constrained types and its application to OOP. In Mathematical Foundations of Programming Semantics, volume 1 of Electronic Notes in Theoretical Computer Science. Elsevier Science, 1995.
    • (1995) Electronic Notes in Theoretical Computer Science , vol.1
    • Eifrig, J.1    Smith, S.F.2    Trifonov, V.3
  • 6
    • 33751050649 scopus 로고    scopus 로고
    • Union types for object-oriented programming
    • Hisham Haddad, editor, Dijon, France, April 23-27, ACM
    • Atsushi Igarashi and Hideshi Nagira. Union types for object-oriented programming. In Hisham Haddad, editor, Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), Dijon, France, April 23-27, 2006, pages 1435-1441. ACM, 2006.
    • (2006) Proceedings of the 2006 ACM Symposium on Applied Computing (SAC) , pp. 1435-1441
    • Igarashi, A.1    Nagira, H.2
  • 11
    • 0347960383 scopus 로고    scopus 로고
    • Type inference for objects
    • Jens Palsberg. Type inference for objects. ACM Comput. Surv., 28(2):358-359, 1996.
    • (1996) ACM Comput. Surv , vol.28 , Issue.2 , pp. 358-359
    • Palsberg, J.1


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