메뉴 건너뛰기




Volumn 33, Issue 10, 1998, Pages 216-225

Parametric Polymorphism for Java™: A Reflective Solution

Author keywords

Language design and implementation; Persistence; Reflection; Research Experience

Indexed keywords


EID: 0347038693     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/286942.286959     Document Type: Article
Times cited : (21)

References (31)
  • 6
    • 0031246718 scopus 로고    scopus 로고
    • The ODMG Object Model: Does it Make Sense?
    • ACM
    • S. Alagić. The ODMG Object Model: Does it Make Sense? In Proceedings of the OOPSLA Conference, pp. 253-270, ACM, 1997.
    • (1997) Proceedings of the OOPSLA Conference , pp. 253-270
    • Alagić, S.1
  • 7
    • 0001639836 scopus 로고
    • Orthogonally Persistent Object Systems
    • M. Atkinson and R. Morrison. Orthogonally Persistent Object Systems. VLDB Journal, 4, 1995, pp. 319-401.
    • (1995) VLDB Journal , vol.4 , pp. 319-401
    • Atkinson, M.1    Morrison, R.2
  • 10
    • 0005099183 scopus 로고    scopus 로고
    • Technical Memorandum MIT LCS TM-553, Laboratory for Computer Science, Massachusetts Institute of Technology
    • J. A. Bank, B. Liskov, and A. C. Myers. Parameterized Types and Java. Technical Memorandum MIT LCS TM-553, Laboratory for Computer Science, Massachusetts Institute of Technology.
    • Parameterized Types and Java
    • Bank, J.A.1    Liskov, B.2    Myers, A.C.3
  • 13
    • 0024715449 scopus 로고
    • A proposal for Making Eiffel Type Safe
    • W. R. Cook. A proposal for Making Eiffel Type Safe. The Computer Journal, 4, 1989, pp. 305-311.
    • (1989) The Computer Journal , vol.4 , pp. 305-311
    • Cook, W.R.1
  • 14
    • 84976859535 scopus 로고
    • Computational Reflection in Class-Based Object-Oriented Languages
    • ACM
    • J. Ferber. Computational Reflection in Class-Based Object-Oriented Languages. In Proceedings of the OOPSLA '89 Conference, ACM, pp. 317-26, 1989.
    • (1989) Proceedings of the OOPSLA '89 Conference , pp. 317-326
    • Ferber, J.1
  • 16
    • 84976817682 scopus 로고
    • A Simple Technique for Handling Multiple Polymorphism
    • ACM
    • D. H. H. Ingalls. A Simple Technique for Handling Multiple Polymorphism. In Proceedings of OOPSLA '86, ACM, pp. 347-349, 1986.
    • (1986) Proceedings of OOPSLA '86 , pp. 347-349
    • Ingalls, D.H.H.1
  • 17
    • 0346613243 scopus 로고    scopus 로고
    • Java Core Reflection, JDK 1.1, Sun Microsystems, Inc.
    • Java Core Reflection, JDK 1.1, Sun Microsystems, Inc., http://java.sun.com.
  • 21
    • 0018105622 scopus 로고
    • A Theory of Type Polymorphism in Programming
    • R. Milner. A Theory of Type Polymorphism in Programming. Journal of Comp. Syst. Scs., Vol. 17, pp. 348-375, 1977.
    • (1977) Journal of Comp. Syst. Scs. , vol.17 , pp. 348-375
    • Milner, R.1
  • 27
    • 0026972623 scopus 로고
    • Bounded Quantification is Undecidable
    • ACM
    • B. C. Pierce. Bounded Quantification is Undecidable. In Proceedings of the POPL Conference, pp. 305-315, ACM, 1993.
    • (1993) Proceedings of the POPL Conference , pp. 305-315
    • Pierce, B.C.1
  • 28
    • 84972537572 scopus 로고
    • Polymorphism is not Set-Theoretic
    • June
    • J. C. Reynolds. Polymorphism is not Set-Theoretic. In Proceedings Intl. Symp. on the Semantics of Data Types, pp. 27-29, June 1984, Lecture Notes in Computer Science, Vol. 173, pp. 145-156, Springer-Verlag, 1984.
    • (1984) Proceedings Intl. Symp. on the Semantics of Data Types , pp. 27-29
    • Reynolds, J.C.1
  • 29
    • 84864840163 scopus 로고
    • Springer-Verlag
    • J. C. Reynolds. Polymorphism is not Set-Theoretic. In Proceedings Intl. Symp. on the Semantics of Data Types, pp. 27-29, June 1984, Lecture Notes in Computer Science, Vol. 173, pp. 145-156, Springer-Verlag, 1984.
    • (1984) Lecture Notes in Computer Science , vol.173 , pp. 145-156


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