메뉴 건너뛰기




Volumn 2006, Issue , 2006, Pages 273-290

A flow-based approach for variant parametric types

Author keywords

Constraints; Flow analysis; Genericity; Subtyping; Variant parametric types

Indexed keywords

FLOW-BASED VARIANT TYPE SYSTEMS; GENERICITY; OBJECT-ORIENTED PARADIGM; SUBTYPING; VARIANT PARAMETRIC TYPES;

EID: 34248181908     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1167473.1167498     Document Type: Conference Paper
Times cited : (11)

References (41)
  • 1
    • 84948972811 scopus 로고
    • The cartesian product algorithm: Simple and precise type inference of parametric polymorphism
    • London, UK, Springer-Verlag
    • Ole Agesen. The cartesian product algorithm: Simple and precise type inference of parametric polymorphism. In ECOOP '95: Proceedings of the 9th European Conference on Object-Oriented Programming, pages 2-26, London, UK, 1995. Springer-Verlag.
    • (1995) ECOOP '95: Proceedings of the 9th European Conference on Object-Oriented Programming , pp. 2-26
    • Agesen, O.1
  • 6
    • 34248159276 scopus 로고    scopus 로고
    • ω. 1994. Available at http://research.microsoft.com/Users/luca/Notes/FwSub.ps.
    • ω. 1994. Available at http://research.microsoft.com/Users/luca/Notes/FwSub.ps.
  • 7
    • 0022333721 scopus 로고
    • On understanding types, data abstraction, and polymorphism
    • Luca Cardelli and Peter Wegner. On understanding types, data abstraction, and polymorphism. ACM Comput. Sun., 17(4):471-522, 1985.
    • (1985) ACM Comput. Sun , vol.17 , Issue.4 , pp. 471-522
    • Cardelli, L.1    Wegner, P.2
  • 18
    • 33748563968 scopus 로고    scopus 로고
    • Variant parametric types: A flexible subtyping scheme for generics
    • Atsushi Igarashi and Mirko Viroli. Variant parametric types: A flexible subtyping scheme for generics. ACM Trans. Program. Lang. Syst., 2006.
    • (2006) ACM Trans. Program. Lang. Syst
    • Igarashi, A.1    Viroli, M.2
  • 20
    • 34248172767 scopus 로고    scopus 로고
    • Karl Mazurak and Steve Zdancewic. Type inference for Java 5: Wildcards, F-Bounds, and Undecidability. 2006. A note available at http://www.cis.upenn. edu/~stevez/note.html.
    • Karl Mazurak and Steve Zdancewic. Type inference for Java 5: Wildcards, F-Bounds, and Undecidability. 2006. A note available at http://www.cis.upenn. edu/~stevez/note.html.
  • 28
    • 0003102688 scopus 로고
    • Bounded quantification is undecidable
    • July
    • Benjamin C. Pierce. Bounded quantification is undecidable. Information and Computation, 112(1):131-165, July 1994.
    • (1994) Information and Computation , vol.112 , Issue.1 , pp. 131-165
    • Pierce, B.C.1
  • 31
    • 84976678569 scopus 로고
    • Precise concrete type inference for object-oriented languages
    • John Plevyak and Andrew A. Chien. Precise concrete type inference for object-oriented languages. In OOPSLA, pages 324-340, 1994.
    • (1994) OOPSLA , pp. 324-340
    • Plevyak, J.1    Chien, A.A.2


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