메뉴 건너뛰기




Volumn 1, Issue 4, 2002, Pages 49-57

The theory of classification part 3: Object encodings and recursion

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; C (PROGRAMMING LANGUAGE); FORMAL LOGIC; JAVA PROGRAMMING LANGUAGE; RECURSIVE FUNCTIONS; SET THEORY; THEOREM PROVING;

EID: 2942704661     PISSN: 16601769     EISSN: None     Source Type: Journal    
DOI: 10.5381/jot.2002.1.4.c4     Document Type: Article
Times cited : (13)

References (8)
  • 1
    • 3042641486 scopus 로고    scopus 로고
    • The theory of classification, part 1: Perspectives on type compatibility
    • May-June
    • A J H Simons, The Theory of Classification, Part 1: Perspectives on Type Compatibility, in Journal of Object Technology, vol. 1, no. 1, May-June 2002, pages 55-61. http://www.jot.fm/issues/issue_2002_05/column?.
    • (2002) Journal of Object Technology , vol.1 , Issue.1 , pp. 55-61
    • Simons, A.J.H.1
  • 2
    • 2942742691 scopus 로고    scopus 로고
    • The theory of classification, part 2: The scratch-built typechecker
    • July-August
    • A J H Simons, The Theory of Classification, Part 2: The Scratch-Built Typechecker, in Journal of Object Technology, vol. 1, no. 2, July-August 2002, pages 47-54. http://www.jot.fm/issues/issue_2002_07/column4.
    • (2002) Journal of Object Technology , vol.1 , Issue.2 , pp. 47-54
    • Simons, A.J.H.1
  • 3
    • 0012523435 scopus 로고
    • User defined types and procedural data structures as complementary approaches to data abstraction
    • ed. D Gries
    • J C Reynolds, User defined types and procedural data structures as complementary approaches to data abstraction, in: Programming Methodology: a Collection of Articles by IFIP WG2.3, ed. D Gries, 1975, 309-317; reprinted from New Advances in Algorithmic Languages, ed. S A Schuman, INRIA, 1975, 157-168.
    • (1975) Programming Methodology: a Collection of Articles by IFIP WG2.3 , pp. 309-317
    • Reynolds, J.C.1
  • 4
    • 3042522835 scopus 로고
    • INRIA
    • J C Reynolds, User defined types and procedural data structures as complementary approaches to data abstraction, in: Programming Methodology: a Collection of Articles by IFIP WG2.3, ed. D Gries, 1975, 309-317; reprinted from New Advances in Algorithmic Languages, ed. S A Schuman, INRIA, 1975, 157-168.
    • (1975) New Advances in Algorithmic Languages , pp. 157-168
    • Schuman, S.A.1
  • 5
    • 84976712057 scopus 로고
    • Object-oriented programming versus abstract data types
    • Foundations of Object-Oriented Languages, eds. J de Bakker et al., Springer Verlag
    • W Cook, Object-oriented programming versus abstract data types, in: Foundations of Object-Oriented Languages, LNCS 489, eds. J de Bakker et al., Springer Verlag, 1991, 151-178.
    • (1991) LNCS , vol.489 , pp. 151-178
    • Cook, W.1
  • 7
    • 0003180840 scopus 로고
    • A formulation of the simple theory of types
    • A Church, A formulation of the simple theory of types, Journal of Symbolic Logic, 5 (1940), 56-68.
    • (1940) Journal of Symbolic Logic , vol.5 , pp. 56-68
    • Church, A.1
  • 8
    • 0022333721 scopus 로고
    • On understanding types, data abstraction and polymorphism
    • L Cardelli and P Wegner, On understanding types, data abstraction and polymorphism, ACM Computing Surveys, 17(4), 1985, 471-521.
    • (1985) ACM Computing Surveys , vol.17 , Issue.4 , pp. 471-521
    • Cardelli, L.1    Wegner, P.2


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