메뉴 건너뛰기




Volumn 1450 LNCS, Issue , 1998, Pages 316-325

The semi-full closure of pure type systems

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; JAVA PROGRAMMING LANGUAGE;

EID: 84896692687     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055781     Document Type: Conference Paper
Times cited : (4)

References (9)
  • 1
    • 0001439401 scopus 로고
    • Lambda calculi with types
    • S. Abramsky, D. Gabbay, and T. Maibaum, editors Oxford Science Publications
    • H. Barendregt. Lambda calculi with types. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science, pages 117-309. Oxford Science Publications, 1992. Volume 2.
    • (1992) Handbook of Logic in Computer Science , vol.2 , pp. 117-309
    • Barendregt, H.1
  • 7
    • 0346516810 scopus 로고
    • Typechecking in pure type systems
    • B. Nordström, editor
    • R. Pollack. Typechecking in pure type systems. In B. Nordström, editor, Informal proceedings of LF'92, pages 271-288, 1992. Available from http://www.dcs.ed.ac.uk/lfcsinfo/research/types-bra/proc/index.html.
    • (1992) Informal Proceedings of LF'92 , pp. 271-288
    • Pollack, R.1


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