메뉴 건너뛰기




Volumn , Issue , 2007, Pages 106-120

Certified decurryfication;Décurryfication certifiée

Author keywords

[No Author keywords available]

Indexed keywords


EID: 84878322667     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (4)

References (15)
  • 2
    • 24344470890 scopus 로고    scopus 로고
    • Interactive theorem proving and program development - Coq'Art: The calculus of inductive constructions
    • Springer-Verlag
    • Y. Bertot and P. Castéran. Interactive Theorem Proving and Program Development - Coq'Art: The Calculus of Inductive Constructions. EATCS Texts in Theoretical Computer Science. Springer-Verlag, 2004.
    • (2004) EATCS Texts in Theoretical Computer Science
    • Bertot, Y.1    Castéran, P.2
  • 4
    • 84878273309 scopus 로고    scopus 로고
    • Coq. http://coq.inria.fr.
  • 5
    • 49649139118 scopus 로고
    • Lambda-calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the church-rosser theorem
    • N. G. de Bruijn. Lambda-calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the church-rosser theorem. Indag. Math, 34, 5: 381-392, 1972.
    • (1972) Indag. Math , vol.34 , Issue.5 , pp. 381-392
    • De Bruijn, N.G.1
  • 6
    • 0004114806 scopus 로고
    • The ZINC experiment: An economical implementation of the ML language
    • INRIA
    • X. Leroy. The ZINC experiment: an economical implementation of the ML language. Rapport technique 117, INRIA, 1990.
    • (1990) Rapport Technique 117
    • Leroy, X.1
  • 7
    • 33745802808 scopus 로고    scopus 로고
    • Formal certification of a compiler back-end, or: Programming a compiler with a proof assistant
    • ACM Press
    • X. Leroy. Formal certification of a compiler back-end, or: programming a compiler with a proof assistant. In 33rd symposium Principles of Programming Languages, pages 42-54. ACM Press, 2006.
    • (2006) 33rd Symposium Principles of Programming Languages , pp. 42-54
    • Leroy, X.1
  • 10
    • 33747182546 scopus 로고    scopus 로고
    • Making a fast curry: Push/enter vs. eval/apply for higher-order languages
    • S. Marlow and S. Peyton Jones. Making a fast curry: push/enter vs. eval/apply for higher-order languages. Journal of Functional Programming, 16(4-5): 375-414, 2006.
    • (2006) Journal of Functional Programming , vol.16 , Issue.4-5 , pp. 375-414
    • Marlow, S.1    Peyton Jones, S.2


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