메뉴 건너뛰기




Volumn 32, Issue 10, 1997, Pages 142-156

Efficient Type Inclusion Tests

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0346353778     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (11)

References (18)
  • 3
    • 84976654194 scopus 로고
    • Type-extension type tests can be performed in constant time
    • N. H. Cohen. Type-extension type tests can be performed in constant time. ACM Transactions on Programming Languages and Systems, 13(4):626-629, 1991.
    • (1991) ACM Transactions on Programming Languages and Systems , vol.13 , Issue.4 , pp. 626-629
    • Cohen, N.H.1
  • 6
    • 0000242271 scopus 로고
    • Recursive programming
    • E. W. Dijkstra. Recursive programming. Numer. Programming, (2):312-318, 1960.
    • (1960) Numer. Programming , Issue.2 , pp. 312-318
    • Dijkstra, E.W.1
  • 8
    • 84948977950 scopus 로고
    • Message dispatch on pipelined processors
    • Proc. European Conference on Object-Oriented Programming, ECOOP'95, Springer-Verlag
    • K. Driesen, U. Hölzle, and J. Vitek. Message dispatch on pipelined processors. In Proc. European Conference on Object-Oriented Programming, ECOOP'95, Lecture Notes in Computer Science. Springer-Verlag, 1995.
    • (1995) Lecture Notes in Computer Science
    • Driesen, K.1    Hölzle, U.2    Vitek, J.3
  • 9
    • 0346563537 scopus 로고    scopus 로고
    • The OOCSB class heterarchy benchmark suite
    • Dept. of Computer Science, University of California, Santa Barbara, July
    • K. Driesen, U. Hölzle, and J. Vitek. The OOCSB class heterarchy benchmark suite. Technical Report TRCS97-09, Dept. of Computer Science, University of California, Santa Barbara, July 1997.
    • (1997) Technical Report TRCS97-09
    • Driesen, K.1    Hölzle, U.2    Vitek, J.3
  • 10
    • 0030257492 scopus 로고    scopus 로고
    • Tree structure for distributive lattices and its applications
    • M. Habib and L. Nourine. Tree structure for distributive lattices and its applications. Theoretical Computer Science, 165:391-405, 1996.
    • (1996) Theoretical Computer Science , vol.165 , pp. 391-405
    • Habib, M.1    Nourine, L.2
  • 12
    • 84947933540 scopus 로고    scopus 로고
    • Near optimal hierarchical encoding of types
    • Proc. European Conference on Object-Oriented Programming, ECOOP'97, Springer-Verlag, June
    • A. Krall, J. Vitek, and R. N. Horspool. Near optimal hierarchical encoding of types. In Proc. European Conference on Object-Oriented Programming, ECOOP'97, Lecture Notes in Computer Science. Springer-Verlag, June 1997.
    • (1997) Lecture Notes in Computer Science
    • Krall, A.1    Vitek, J.2    Horspool, R.N.3
  • 16
    • 85027522532 scopus 로고
    • Taming message passing: Efficient method look-up for dynamically-typed languages
    • Proc. European Conference on Object Oriented Programming, ECOOP'94, Springer-Verlag
    • J. Vitek and R. N. Horspool. Taming message passing: Efficient method look-up for dynamically-typed languages. In Proc. European Conference on Object Oriented Programming, ECOOP'94, Lecture Notes in Computer Science. Springer-Verlag, 1994.
    • (1994) Lecture Notes in Computer Science
    • Vitek, J.1    Horspool, R.N.2
  • 18
    • 84976748104 scopus 로고
    • Reply to "type-extension type tests can be performed in constant time"
    • N. Wirth. Reply to "type-extension type tests can be performed in constant time". ACM Transactions on Programming Languages and Systems, 13(4):630, 1991.
    • (1991) ACM Transactions on Programming Languages and Systems , vol.13 , Issue.4 , pp. 630
    • Wirth, N.1


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