메뉴 건너뛰기




Volumn 31, Issue , 2004, Pages 293-305

A type system for well-founded recursion

Author keywords

Effect systems; Recursion; Recursive modules; Type systems

Indexed keywords

COMPUTATIONAL METHODS; ERROR ANALYSIS; RECURSIVE FUNCTIONS; SEMANTICS; STATISTICAL METHODS;

EID: 2442495247     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/964001.964026     Document Type: Conference Paper
Times cited : (8)

References (31)
  • 4
    • 1442356986 scopus 로고    scopus 로고
    • The recursive record semantics of objects revisited
    • Research report 4199, INRIA. To appear in the
    • Gerard Boudol. The recursive record semantics of objects revisited. Research report 4199, INRIA, 2001. To appear in the Journal of Functional Programming.
    • (2001) Journal of Functional Programming
    • Boudol, G.1
  • 7
    • 1442356987 scopus 로고    scopus 로고
    • A type system for well-founded recursion
    • Carnegie Mellon University, July
    • Derek Dreyer, Robert Harper, and Karl Crary. A type system for well-founded recursion. Technical Report CMU-CS-03-163, Carnegie Mellon University, July 2003.
    • (2003) Technical Report , vol.CMU-CS-03-163
    • Dreyer, D.1    Harper, R.2    Crary, K.3
  • 8
    • 0002917372 scopus 로고    scopus 로고
    • Toward a practical type theory for recursive modules
    • School of Computer Science, Carnegie Mellon University, March
    • Derek R. Dreyer, Robert Harper, and Karl Crary. Toward a practical type theory for recursive modules. Technical Report CMU-CS-01-112, School of Computer Science, Carnegie Mellon University, March 2001.
    • (2001) Technical Report , vol.CMU-CS-01-112
    • Dreyer, D.R.1    Harper, R.2    Crary, K.3
  • 10
    • 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
  • 14
    • 0011979298 scopus 로고    scopus 로고
    • Recursion is a computational effect
    • Indiana University, December
    • Daniel P. Friedman and Amr Sabry. Recursion is a computational effect. Technical Report TR546, Indiana University, December 2000.
    • (2000) Technical Report , vol.TR546
    • Friedman, D.P.1    Sabry, A.2
  • 15
    • 0030552161 scopus 로고    scopus 로고
    • Weak polymorphism can be sound
    • John Greiner. Weak polymorphism can be sound. Journal of Functional Programming, 6(1):111-141, 1996.
    • (1996) Journal of Functional Programming , vol.6 , Issue.1 , pp. 111-141
    • Greiner, J.1
  • 23
    • 0036957923 scopus 로고    scopus 로고
    • Meta-programming with names and necessity
    • Pittsburgh, PA. A significant revision is available as a technical report CMU-CS-02-123R, Carnegie Mellon University
    • Aleksandar Nanevski. Meta-programming with names and necessity. In 2002 International Conference on Functional Programming, pages 206-217, Pittsburgh, PA, 2002. A significant revision is available as a technical report CMU-CS-02-123R, Carnegie Mellon University.
    • (2002) 2002 International Conference on Functional Programming , pp. 206-217
    • Nanevski, A.1
  • 24
    • 1242263602 scopus 로고    scopus 로고
    • A modal calculus for effect handling
    • Carnegie Mellon University, June
    • Aleksandar Nanevski. A modal calculus for effect handling. Technical Report CMU-CS-03-149, Carnegie Mellon University, June 2003.
    • (2003) Technical Report , vol.CMU-CS-03-149
    • Nanevski, A.1
  • 27
    • 84976496175 scopus 로고    scopus 로고
    • A metalanguage for programming with bound names modulo renaming
    • Roland Backhouse and José Nuno Oliveira, editors. Springer
    • Andrew M. Pitts and Murdoch J. Gabbay. A metalanguage for programming with bound names modulo renaming. In Roland Backhouse and José Nuno Oliveira, editors, Mathematics of Program Construction, volume 1837 of Lecture Notes in Computer Science, pages 230-255. Springer, 2000.
    • (2000) Mathematics of Program Construction, Volume 1837 of Lecture Notes in Computer Science , vol.1837 , pp. 230-255
    • Pitts, A.M.1    Gabbay, M.J.2
  • 28
    • 0034775933 scopus 로고    scopus 로고
    • Recursive structures for standard ML
    • Florence, Italy, September
    • Claudio V. Russo. Recursive structures for Standard ML. In International Conference on Functional Programming, pages 50-61, Florence, Italy, September 2001.
    • (2001) International Conference on Functional Programming , pp. 50-61
    • Russo, C.V.1
  • 31
    • 0001020708 scopus 로고
    • Simple imperative polymorphism
    • Andrew K. Wright. Simple imperative polymorphism. Lisp and Symbolic Computation, 8(4):343-355, 1995.
    • (1995) Lisp and Symbolic Computation , vol.8 , Issue.4 , pp. 343-355
    • Wright, A.K.1


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