메뉴 건너뛰기




Volumn 36, Issue 3, 2001, Pages 261-275

Type-indexed rows

Author keywords

[No Author keywords available]

Indexed keywords


EID: 17644402124     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/373243.360230     Document Type: Article
Times cited : (8)

References (31)
  • 1
    • 0033226029 scopus 로고    scopus 로고
    • Introduction to set constraint-based program analysis
    • A. Aiken. Introduction to set constraint-based program analysis. Science of Computer Programming, 35:79-111, 1999.
    • (1999) Science of Computer Programming , vol.35 , pp. 79-111
    • Aiken, A.1
  • 11
    • 17644410032 scopus 로고    scopus 로고
    • Lightweight extensible records for Haskell
    • Oct Published in Technical Report UU-CS-1999-28, Department of Computer Science, University of Utrecht
    • M. Jones and S. Peyton Jones. Lightweight extensible records for Haskell. In Proceedings of the 1999 Haskell Workshop, Paris, France, Oct 1999. Published in Technical Report UU-CS-1999-28, Department of Computer Science, University of Utrecht.
    • (1999) Proceedings of the 1999 Haskell Workshop, Paris, France
    • Jones, M.1    Peyton Jones, S.2
  • 12
    • 0003465573 scopus 로고
    • Distinguished Dissertations in Computer Science. Cambridge University Press
    • M. P. Jones. Qualified Types: Theory and Practice. Distinguished Dissertations in Computer Science. Cambridge University Press, 1994.
    • (1994) Qualified Types: Theory and Practice
    • Jones, M.P.1
  • 19
    • 0029404987 scopus 로고
    • A polymorphic record calculus and its compilation
    • Nov Earlier version appears in POPL'93, pp. 99-112
    • A. Ohori. A polymorphic record calculus and its compilation. ACM Transactions on Programming Languages and Systems, 17(6):844-895, Nov 1995. Earlier version appears in POPL'93, pp. 99-112.
    • (1995) ACM Transactions on Programming Languages and Systems , vol.17 , Issue.6 , pp. 844-895
    • Ohori, A.1
  • 21
    • 0005096066 scopus 로고    scopus 로고
    • Intersection types and bounded polymorphism
    • Apr
    • B. C. Pierce. Intersection types and bounded polymorphism. Mathematical Structures in Computer Science, 7(2):129-193, Apr 1997.
    • (1997) Mathematical Structures in Computer Science , vol.7 , Issue.2 , pp. 129-193
    • Pierce, B.C.1
  • 23
    • 1542766965 scopus 로고
    • Type inference for records in a natural extension of ML
    • C. A. Gunter and J. C. Mitchell, editors, The MIT Press, Earlier verision appears in POPL'89
    • D. Rémy. Type inference for records in a natural extension of ML. In C. A. Gunter and J. C. Mitchell, editors, Theoretical Aspects Of Object-Oriented Programming. Types, Semantics and Language Design. The MIT Press, 1993. Earlier verision appears in POPL'89, pp. 77-87.
    • (1993) Theoretical Aspects of Object-Oriented Programming. Types, Semantics and Language Design , pp. 77-87
    • Rémy, D.1
  • 24
    • 0013419335 scopus 로고    scopus 로고
    • Design of the programming language FORSYTHE
    • P. W. O'Hearn and R. D. Tennent, editors, Birkhäuser
    • J. C. Reynolds. Design of the programming language FORSYTHE. In P. W. O'Hearn and R. D. Tennent, editors, ALGOL-like Languages, pages 173-233. Birkhäuser, 1997.
    • (1997) ALGOL-like Languages , pp. 173-233
    • Reynolds, J.C.1
  • 25
    • 0005007555 scopus 로고    scopus 로고
    • PhD thesis, Oregon Graduate Institute, Jan To appear
    • M. Shields. Static Types for Dynamic Documents. PhD thesis, Oregon Graduate Institute, Jan 2001. (To appear. Draft available at http://vw.cse.ogi.edu/~mbs).
    • (2001) Static Types for Dynamic Documents
    • Shields, M.1
  • 26
    • 0032675774 scopus 로고    scopus 로고
    • An algorithm for general set unification and its complexity
    • Jan
    • F. Stolzenburg. An algorithm for general set unification and its complexity. Journal of Automated Reasoning, 22(1):45-63, Jan 1999.
    • (1999) Journal of Automated Reasoning , vol.22 , Issue.1 , pp. 45-63
    • Stolzenburg, F.1
  • 31
    • 0026187053 scopus 로고
    • Type inference for record concatenation and multiple inheritance
    • Jul
    • M. Wand. Type inference for record concatenation and multiple inheritance. Information and Computation, 93(1):1-15, Jul 1991.
    • (1991) Information and Computation , vol.93 , Issue.1 , pp. 1-15
    • Wand, M.1


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