A Co-inductive approach to real numbers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1956, Issue , 2000, Pages 114-130

  Ciaffaglione, Alberto ^a   di Gianantonio, Pietro ^a  

^a UNIVERSITY OF UDINE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CONSTRUCTIVE REALS; INDUCTIVE-TYPE; LOGICAL FRAMEWORKS; REAL NUMBER;

THEOREM PROVING;

EID: 84977570798     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44557-9_7     Document Type: Conference Paper

References (23)

1. R. Amadio and S. Coupet.’’Analysis of a guard condition in Type Theory”. Technical report, INRIA, 1997.
2. E. Bishop.’’Foundations of constructive analysis”. McGraw-Hill, New York, 1967.
3. L.E.J. Brouwer.’’Beweis, dass jede volle Funktion gleichmässig stetig ist”. In Proc. Amsterdam 27, pages 189-194, 1924.
4. J. Cederquist.”A pointfree approach to Constructive Analysis in Type Theory”. PhD thesis, Göteborg University, 1997.
5. J. Chirimar and D.J. Howe.’’Implementing constructive real analysis: preliminar report”. LNCS, 613, 1992.
6. R.L. Constable.’’Implementing mathematics with the Nuprl development system”. Prentice-Hall, 1986.
7. T. Coquand.’’Pattern-matching in Type Theory”. In Informal Proceedings of the 1992 Workshop on Types for Proofs and Programs, 1992.
8. T. Coquand.’’Infinite objects in Type Theory”. In 1st Workshop on Types for Proofs and Programs, LNCS 806, 1993.
9. The’’Fundamental theorem of Algebra” Project, 1999. Computing Science Institute Nijmegen, http://www.cs.kun.nl/~freek/fta/index.html.
10. E. Gimenez.’’Codifying guarded definitions with recursion schemes”. In 5th Workshop on Types for Proofs and Programs, LNCS 996, 1994.
11. E. Gimenez.”A tutorial on recursive types in Coq”. Technical report, INRIA, 1998.
12. E. Gimenez.’’Structural recursive definitions in Type Theory”. In Proceedings of ICALP’98, LNCS 1443, 1998.
13. M.J.C. Gordon and T.F. Melham.’’Introduction to HOL: a theorem proving environment for higher order logic”. Cambridge University Press, 1993.
14. J.R. Harrison.’’Theorem proving with real numbers”. PhD thesis, Uni-versitiy of Cambridge, 1996.
15. INRIA, project Coq.”The Coq proof assistant - Reference manual V6.3.1”, May 2000.
16. C. Jones.’’Completing the rationals and metric spaces in Lego”. In Cambridge Universitiy Press, editor, Logical Frameworks, pages 209-222. 1991.
17. L. Magnusson.”The implementation of Alf”. PhD thesis, Chalmers University of Technology, Goteborg, 1995.
18. P.J. Potts, A. Edalat, and M.H. Escardo.’’Semantics of exact real arithmetic”. In IEEE Symposium on Logic in Computer Science, 1997.
19. C. Paulin-Mohring.”Inductive definitions in the system Coq: rules and properties”. In Proceedings of the TLCA, 1993.
20. R. Pollack.”The theory of Lego, a proof checker for the Extended Calculus of Constructions”. PhD thesis, University of Edimburgh, 1994.
21. A. Simpson.”Lazy functional algorithms for exact real functionals”. In MFCS 1998. Springer Verlag, 1998.
22. A.S. Troelstra and D. van Dalen.’’Constructivism in Mathematics”. North-Holland, 1988.
23. K. Weihrauch.”A foundation for computable analysis”. In Proceedings of DMTCS 1996, 1996.