메뉴 건너뛰기




Volumn , Issue , 1988, Pages 174-183

Type inference in a database programming language

Author keywords

[No Author keywords available]

Indexed keywords

LISP (PROGRAMMING LANGUAGE);

EID: 84899524693     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/62678.62700     Document Type: Conference Paper
Times cited : (46)

References (13)
  • 1
    • 84915868847 scopus 로고
    • Theoreical Computer Science, To Appear. Available as a technical report from Department of Computer and Information Science, University of Pennsylvania
    • [B088] O.P. Buneman and A. Ohori. Using Powerdomains to Generalize Relational Databases. Theoreical Computer Science, To Appear, 1988. Available as a technical report from Department of Computer and Information Science, University of Pennsylvania.
    • (1988) Using Powerdomains to Generalize Relational Databases
    • Buneman, O.P.1    Ohori, A.2
  • 3
    • 0022333721 scopus 로고
    • On understanding types, data abstraction, and polymorphism
    • December
    • [CW86] L. Cardelli and P. Wegner. On Understanding Types, Data Abstraction, and Polymorphism. Computing Surverys, 17(4):471-522, December 1986.
    • (1986) Computing Surverys , vol.17 , Issue.4 , pp. 471-522
    • Cardelli, L.1    Wegner, P.2
  • 9
    • 0018105622 scopus 로고
    • A theory of type polymorphism in programming
    • [MI178] R. Milner. A Theory of Type Polymorphism in Programming. Journal of Computer and System Sciences, 17:348-375, 1978.
    • (1978) Journal of Computer and System Sciences , vol.17 , pp. 348-375
    • Milner, R.1
  • 11
    • 84918983692 scopus 로고
    • A machine-oriented logic based on the resolution principle
    • March
    • [Rob65] Robinson, J. A. A machine-oriented logic based on the resolution principle. Journal of the ACM, 12:23-41, March 1965.
    • (1965) Journal of the ACM , vol.12 , pp. 23-41
    • Robinson, J.A.1


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