메뉴 건너뛰기




Volumn 1295, Issue , 1997, Pages 189-198

Subtyping calculus of construction

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LANGUAGES; THEOREM PROVING;

EID: 84947751921     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0029962     Document Type: Conference Paper
Times cited : (6)

References (14)
  • 4
    • 84947811094 scopus 로고
    • Inheritance in type theory
    • G. Barthe. Inheritance in type theory, TYPES'95, 1995.
    • (1995) TYPES'95
    • Barthe, G.1
  • 7
    • 84947784901 scopus 로고    scopus 로고
    • To appear in KIT Summer School and Workshop on Formal Models of Programming and their Applications, Beijing
    • G. Chen. Dependent type system with subtyping. To appear in KIT Summer School and Workshop on Formal Models of Programming and their Applications, Beijing, 1997.
    • (1997) Dependent Type System with Subtyping
    • Chen, G.1
  • 8
    • 84947740078 scopus 로고    scopus 로고
    • Subtyping in Fw is decidable
    • A. Compagnoni. Subtyping in Fw is decidable. CSL'94.
    • CSL'94
    • Compagnoni, A.1
  • 10
    • 84958780590 scopus 로고    scopus 로고
    • Coercive subtyping in type theory
    • Z. Luo. Coercive subtyping in type theory. In CSL'96.
    • CSL'96
    • Luo, Z.1
  • 11
    • 0023965762 scopus 로고
    • Polymorphic type inference and containment
    • J.C. Mitchell. Polymorphic type inference and containment. Information and Computation, 76:211-249, 1988.
    • (1988) Information and Computation , vol.76 , pp. 211-249
    • Mitchell, J.C.1


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