메뉴 건너뛰기




Volumn , Issue , 2005, Pages 9-13

Laziness without all the hard work: Combining lazy and strict languages for teaching

Author keywords

Lazy and Eager Evaluation; PLT Scheme; Teaching Programming Languages

Indexed keywords

LAZY AND EAGER EVALUATION; PLT SCHEME; TEACHING PROGRAMMING LANGUAGES;

EID: 32044435596     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1085114.1085118     Document Type: Conference Paper
Times cited : (10)

References (13)
  • 4
    • 0026394160 scopus 로고
    • On the expressive power of programming languages
    • M. Felleisen. On the expressive power of programming languages. Science of Computer Programming, 17:35-75, 1991.
    • (1991) Science of Computer Programming , vol.17 , pp. 35-75
    • Felleisen, M.1
  • 9
    • 0342406334 scopus 로고
    • Report on the programming language Haskell
    • Yale University, Department of Computer Science, August
    • P. Hudak and P. Wadler. Report on the programming language Haskell. Technical Report YALE/DCS/RR777, Yale University, Department of Computer Science, August 1991.
    • (1991) Technical Report , vol.YALE-DCS-RR777
    • Hudak, P.1    Wadler, P.2
  • 12
    • 85035001592 scopus 로고
    • Definitional interpreters for higher-order programming languages
    • ACM Press
    • J. C. Reynolds. Definitional interpreters for higher-order programming languages. In ACM '72: Proceedings of the ACM annual conference, pages 717-740. ACM Press, 1972.
    • (1972) ACM '72: Proceedings of the ACM Annual Conference , pp. 717-740
    • Reynolds, J.C.1
  • 13
    • 78249244287 scopus 로고    scopus 로고
    • How to add laziness to a strict language, without even being odd
    • Baltimore, September
    • P. Wadler, W. Taha, and D. MacQueen. How to add laziness to a strict language, without even being odd. In Workshop on Standard ML, Baltimore, September 1998.
    • (1998) Workshop on Standard ML
    • Wadler, P.1    Taha, W.2    MacQueen, D.3


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