Formalising exact arithmetic in type theory

Lecture Notes in Computer Science

Volumn 3526, Issue , 2005, Pages 368-377

  Niqui, Milad ^a  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DIGITAL ARITHMETIC; NUMBER THEORY; SYNTACTICS;

CONSTRUCTIVE TYPE THEORY; FORMALIZATION; NUMBER REPRESENTATION;

COMPUTATION THEORY;

EID: 26444575920     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11494645_46     Document Type: Conference Paper

References (13)

1. Potts, P.J., Edalat, A.: Exact real computer arithmetic. Technical Report DOC 97/9, Department of Computing, Imperial College (1997)
2. Edalat, A., Potts, P.J., Sünderhauf, P.: Lazy computation with exact real numbers. In Berman, M., Berman, S., eds.: Proceedings of the third ACM SIGPLAN International Conference on Functional Programming (ICFP-98), Baltimore, Maryland, USA, September 27-29, 1998. Volume 34(1) of ACM SIGPLAN Notices., New York, ACM Press (1999) 185-194
3. Niqui, M.: Formalising Exact Arithmetic: Representations, Algorithms and Proofs. PhD thesis, Radboud Universiteit Nijmegen (2004)
4. Giménez, E.: Un Calcul de Constructions Infinies et son Application a la Verification des Systemes Communicants. PhD thesis PhD 96-11, Laboratoire de l'Informatique du Parallélisme, Ecole Normale Supérieure de Lyon (1996)
5. The Coq Development Team: The Coq Proof Assistant Reference Manual, Version 8.0. INRIA. (2004) http://coq.inria.fr/doc/main.html, [cited 31st January 2005].
6. Hagino, T.: A Categorical Programming Language. PhD thesis CST-47-87, Laboratory for Foundations of Computer Science, Dept. of Computer Science, Univ. of Edinburgh (1987)
7. Jacobs, B.: Categorical Logic and Type Theory. Volume 141 of Studies in Logic and the Foundations of Mathematics. Elsevier Science Publishers, Amsterdam (1998)
8. Martin-Löf, P.: Intuitionistic Type Theory. Biblioplois, Napoli (1984) Notes of Giovanni Sambin on a series of lectures given in Padova.
9. Coquand, T., Paulin, C.: Inductively defined types (preliminary version). In Martin-Lof, P., Mints, G., eds.: COLOG-88, International Conference on Computer Logic, Tallinn, USSR, December 1988, Proceedings. Volume 417 of Lecture Notes in Comput. Sci. Springer-Verlag (1990) 50-66
10. Potts, P.J.: Exact Real Arithmetic using Möbius Transformations. PhD thesis, University of London, Imperial College (1998)
11. Saïbi, A.: Typing algorithm in type theory with inheritance. In: POPL '97: Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, ACM SIGACT and SIGPLAN, ACM Press (1997) 292-301
12. Sijtsma, B.A.: On the productivity of recursive list definitions. ACM Trans. Program. Lang. Syst. (TOPLAS) 11 (1989) 633-649
13. Weihrauch, K.: Computable Analysis. An introduction. Springer-Verlag, Berlin Heidelberg (2000) 285 pp.