메뉴 건너뛰기




Volumn 34, Issue 5, 1999, Pages 50-60

What is a recursive module?

Author keywords

[No Author keywords available]

Indexed keywords


EID: 17244377415     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/301631.301641     Document Type: Article
Times cited : (26)

References (23)
  • 1
    • 0027667776 scopus 로고
    • Subtyping recursive types
    • Roberto Amadio and Luca Cardelli. Subtyping recursive types. ACM TOPLAS, 15(4):575-631, 1993.
    • (1993) ACM TOPLAS , vol.15 , Issue.4 , pp. 575-631
    • Amadio, R.1    Cardelli, L.2
  • 2
    • 24944439199 scopus 로고    scopus 로고
    • An algebra of mixin modules
    • F. Parisi-Presicce, editor, WADT '97 12th Workshop on Algebraic Development Techniques - Selected Papers, Berlin, Springer Verlag
    • Davide Ancona and Elena Zucca. An algebra of mixin modules. In F. Parisi-Presicce, editor, WADT '97 12th Workshop on Algebraic Development Techniques - Selected Papers, volume 1376 of Lecture Notes in Computer Science, pages 92-106, Berlin, 1997. Springer Verlag.
    • (1997) Lecture Notes in Computer Science , vol.1376 , pp. 92-106
    • Ancona, D.1    Zucca, E.2
  • 3
    • 0040412232 scopus 로고    scopus 로고
    • PhD thesis, Princeton University, Department of Computer Science, Princeton, New Jersey, November
    • Matthias Blume. Hierarchical Modularity and Intermodule Optimization. PhD thesis, Princeton University, Department of Computer Science, Princeton, New Jersey, November 1997.
    • (1997) Hierarchical Modularity and Intermodule Optimization
    • Blume, M.1
  • 7
    • 0002459291 scopus 로고    scopus 로고
    • Parameterized modules, recursive modules, and mixin modules
    • Baltimore, Maryland, September
    • Dominic Duggan and Constantinos Sourelis. Parameterized modules, recursive modules, and mixin modules. In 1998 ACM SIGPLAN Workshop on ML, pages 87-96, Baltimore, Maryland, September 1998.
    • (1998) 1998 ACM SIGPLAN Workshop on ML , pp. 87-96
    • Duggan, D.1    Sourelis, C.2
  • 17
    • 84951060219 scopus 로고    scopus 로고
    • The equivalence problem for deterministic pushdown automata is decidable
    • Twenty-Fourth International Colloquium on Automata, Languages, and Programming, Bologna, Italy, July Springer-Verlag
    • Géraud Sénizergues. The equivalence problem for deterministic pushdown automata is decidable. In Twenty-Fourth International Colloquium on Automata, Languages, and Programming, volume 1256 of Lecture Notes in Computer Science, pages 671-681, Bologna, Italy, July 1997. Springer-Verlag.
    • (1997) Lecture Notes in Computer Science , vol.1256 , pp. 671-681
    • Sénizergues, G.1


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