메뉴 건너뛰기




Volumn 85, Issue 7, 2003, Pages 1-16

A simple canonical representation of rational numbers

(1)  Bertot, Yves a  

a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; MATHEMATICAL MODELS; THEOREM PROVING;

EID: 18944370368     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80754-0     Document Type: Conference Paper
Times cited : (4)

References (10)
  • 1
    • 84949183434 scopus 로고    scopus 로고
    • Fix-point equations for well-founded recursion in type theory
    • J. Harrison and M. Aagaard, editors, Theorem Proving in Higher Order Logics: 13th International Conference, TPHOLs 2000 Springer-Verlag
    • Antonia Balaa and Yves Bertot. Fix-point equations for well-founded recursion in type theory. In J. Harrison and M. Aagaard, editors, Theorem Proving in Higher Order Logics: 13th International Conference, TPHOLs 2000, volume 1869 of Lecture Notes in Computer Science, pages 1-16. Springer-Verlag, 2000.
    • (2000) Lecture Notes in Computer Science , vol.1869 , pp. 1-16
    • Balaa, A.1    Bertot, Y.2
  • 2
    • 84949501091 scopus 로고    scopus 로고
    • Nested general recursion and partiality in type theory
    • Richard J. Boulton and Paul B. Jackson, editors, Theorem Proving in Higher Order Logics: 14th International Conference, TPHOLs 2001 Springer-Verlag, September
    • Ana Bove and Venanzio Capretta. Nested general recursion and partiality in type theory. In Richard J. Boulton and Paul B. Jackson, editors, Theorem Proving in Higher Order Logics: 14th International Conference, TPHOLs 2001, volume 2152 of Lecture Notes in Computer Science, pages 121-135. Springer-Verlag, September 2001.
    • (2001) Lecture Notes in Computer Science , vol.2152 , pp. 121-135
    • Bove, A.1    Capretta, V.2
  • 4
    • 18944368028 scopus 로고    scopus 로고
    • Field: Une procédure de décision pour les nombres réels en coq
    • INRIA
    • David Delahaye and Micaela Mayero. Field: une procédure de décision pour les nombres réels en coq. In Proceedings of JFLA '2001. INRIA, 2001.
    • (2001) Proceedings of JFLA '2001
    • Delahaye, D.1    Mayero, M.2
  • 6
    • 0041160910 scopus 로고    scopus 로고
    • On the teeth of wheels
    • Brian Hayes. On the teeth of wheels. American Scientist. 88:(4):july-august 2000;296-300
    • (2000) American Scientist , vol.88 , Issue.4 , pp. 296-300
    • Brian, H.1
  • 7
    • 18944403761 scopus 로고
    • LCF: A lexicographic binary representation of the rationals
    • Kornerup Peter, Matula David. LCF: A lexicographic binary representation of the rationals. Journal of Universal Computer Science. 1:(7):july 1995;484-503
    • (1995) Journal of Universal Computer Science , vol.1 , Issue.7 , pp. 484-503
    • Kornerup, P.1    Matula, D.2
  • 10
    • 0025470202 scopus 로고
    • Exact real computer arithmetic with continued fractions
    • Vuillemin E.Jean. Exact real computer arithmetic with continued fractions. IEEE Transactions on Computers. 39:(8):Aug 1990;1087-1105
    • (1990) IEEE Transactions on Computers , vol.39 , Issue.8 , pp. 1087-1105
    • Vuillemin, E.J.1


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