메뉴 건너뛰기




Volumn 32, Issue 2, 2010, Pages

Hybrid type checking

Author keywords

Contracts; Dynamic checking; Static checking; Type systems

Indexed keywords

DEPENDENT FUNCTIONS; DETECTION OF DEFECTS; DYNAMIC CHECKING; HYBRID TYPE; INTERFACE SPECIFICATION; RUNTIMES; STATIC CHECKING; STATIC TYPE SYSTEMS; TYPE SYSTEMS;

EID: 76749109920     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/1667048.1667051     Document Type: Article
Times cited : (93)

References (55)
  • 1
    • 0015346655 scopus 로고
    • A technique for software module specification with examples
    • PARNAS, D. L. 1972. A technique for software module specification with examples. Comm. ACM 15, 5, 330-336.
    • (1972) Comm. ACM , vol.15 , Issue.5 , pp. 330-336
    • Parnas, D.L.1
  • 7
    • 33745867351 scopus 로고    scopus 로고
    • Sound and complete models for contracts
    • BLUME, M. AND MCALLESTER, D. 2006. Sound and complete models for contracts. J. Funct. Program. 16, 375-414.
    • (2006) J. Funct. Program. , vol.16 , pp. 375-414
    • Blume, M.1    McAllester, D.2
  • 11
    • 84974613879 scopus 로고
    • Typechecking dependent types and subtypes
    • Lecture Notes in Computer Science. Springer
    • CARDELLI, L. 1988b. Typechecking dependent types and subtypes. In Foundations of Logic and Functional Programming. Lecture Notes in Computer Science. Springer, 45-57.
    • (1988) Foundations of Logic and Functional Programming , pp. 45-57
    • Cardelli, L.1
  • 14
    • 24944448541 scopus 로고    scopus 로고
    • Simplify: A theorem prover for program checking
    • DETLEFS, D., NELSON, G., AND SAXE, J. B. 2005. Simplify: A theorem prover for program checking. J. ACM 52, 3, 365-473.
    • (2005) J. ACM , vol.52 , Issue.3 , pp. 365-473
    • Detlefs, D.1    Nelson, G.2    Saxe, J.B.3
  • 15
    • 0345876038 scopus 로고
    • Ph.D. thesis, Rice University
    • FAGAN, M. 1990. Soft typing. Ph.D. thesis, Rice University.
    • (1990) Soft Typing
    • Fagan, M.1
  • 29
    • 0028448324 scopus 로고
    • Dynamic typing: Syntax and proof theory
    • HENGLEIN, F. 1994. Dynamic typing: Syntax and proof theory. Sci. Comput. Program. 22, 3, 197-230.
    • (1994) Sci. Comput. Program. , vol.22 , Issue.3 , pp. 197-230
    • Henglein, F.1
  • 31
    • 0024132808 scopus 로고
    • The Turing programming language
    • HOLT, R. C. AND CORDY, J. R. 1988. The Turing programming language. Comm. ACM31, 1310-1424.
    • (1988) Comm. ACM , vol.31 , pp. 1310-1424
    • Holt, R.C.1    Cordy, J.R.2
  • 46
    • 0022068576 scopus 로고
    • Logical relations and the typed lambda-calculus
    • STATMAN, R. 1985. Logical relations and the typed lambda-calculus. Inform. Control 65, 2-3, 85-97.
    • (1985) Inform. Control , vol.65 , Issue.2-3 , pp. 85-97
    • Statman, R.1
  • 53
    • 0003025818 scopus 로고
    • A syntactic approach to type soundness
    • WRIGHT, A. AND FELLEISEN, M. 1994. A syntactic approach to type soundness. Inform. Comput. 115, 1, 38-94.
    • (1994) Inform. Comput. , vol.115 , Issue.1 , pp. 38-94
    • Wright, A.1    Felleisen, M.2


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