메뉴 건너뛰기




Volumn , Issue , 1989, Pages 293-298

On the complexity of type inference with coercion

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT DATA TYPES; CALCULATIONS; COMPUTER ARCHITECTURE; COMPUTER PROGRAMMING LANGUAGES; DIFFERENTIATION (CALCULUS); FORESTRY; POLYNOMIAL APPROXIMATION; SET THEORY;

EID: 85030718602     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/99370.99394     Document Type: Conference Paper
Times cited : (16)

References (8)
  • 1
    • 84913466683 scopus 로고
    • Basic polymorphic typechecking
    • Jan Also appeared as Computing Science Tech. Rep. 119, AT&T Bell Laboratories, Murray Hill, N J
    • Caidelli, L. "Basic Polymorphic Typechecking, " Polymorphism Newsletter 2, 1 (Jan, 1985). Also appeared as Computing Science Tech. Rep. 119, AT&T Bell Laboratories, Murray Hill, N J.
    • (1985) Polymorphism Newsletter , vol.2 , Issue.1
    • Caidelli, L.1
  • 4
    • 84968503882 scopus 로고
    • The principal type-scheme of an object in combinatory logic
    • Hindley, R. "The Principal Type-Scheme of an Object in Combinatory Logic, " Trans. Am. Math. Soc. 146 (1969) 29-60.
    • (1969) Trans. Am. Math. Soc. , vol.146 , pp. 29-60
    • Hindley, R.1
  • 7
    • 0018105622 scopus 로고
    • A theory of type polymorphism in programming
    • Milner, R. "A Theory of Type Polymorphism in Programming, " /. Comp. & Sys. Sei. 7(1978), 348-375.
    • (1978) Comp. & Sys. Sei. , vol.7 , pp. 348-375
    • Milner, R.1


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