Coinductive Field of Exact Real Numbers and General Corecursion

Electronic Notes in Theoretical Computer Science

Volumn 164, Issue 1, 2006, Pages 121-139

  Niqui, Milad ^a  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

Coinductive types; exact real arithmetic; general corecursion

Indexed keywords

COALGEBRA; COINDUCTIVE TYPES; EXACT REAL ARITHMETIC; GENERAL CORECURSION;

ALGORITHMS; COMPUTER SCIENCE; LINEAR ALGEBRA; MAPS; QUADRATIC PROGRAMMING; THEOREM PROVING;

NUMBER THEORY;

EID: 33749569490     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2006.06.008     Document Type: Article

References (31)

1. Abbott M., Altenkirch T., and Ghani N. Containers - constructing strictly positive types. Theoret. Comput. Sci. 342 (Sept. 2005) 3-27
2. Bartels F. Generalised coinduction. In: Corradini A., Lenisa M., and Montanari U. (Eds). Proc. of 4th Workshop on Coalgebraic Methods in Computer Science. CMCS'01, Genova, Italy, 6-7 Apr. 2001. Electron. Notes Theor. Comput. Sci. volume 44(1) (2001), Elsevier Science Publishers, Amsterdam
3. Y. Bertot. CoInduction in Coq. In Lecture Notes of TYPES Summer School 2005, August 1526 2005, Göteborg, Sweden. vol II, 2005. http://www.cs.chalmers.se/Cs/Research/Logic/TypesSS05/Extra/lectnotes_vol2.pdf, [cited 19 May 2006]
4. Bertot Y. Filters on coinductive streams, an application to Eratosthenes' sieve. In: Urzyczyn P. (Ed). TLCA. Lecture Notes in Comput. Sci. volume 3461 (2005), Springer-Verlag 102-115
5. Bove A., and Capretta V. Nested general recursion and partiality in type theory. In: Boulton R.J., and Jackson P.B. (Eds). Theorem Proving in Higher Order Logics. 14th International Conference, TPHOLs 2001, Edinburgh, Scotland, UK, September 3-6, 2001. Lecture Notes in Comput. Sci. volume 2152 (2001), Springer-Verlag 121-135 Proceedings
6. Cancila D., Honsell F., and Lenisa M. Generalized coiteration schemata. In: Gumm P. (Ed). Proc. of 6th Workshop on Coalgebraic Methods in Computer Science. CMCS'03, Warsaw, 5-6 Apr. 2003. Electron. Notes Theor. Comput. Sci. volume 82(1) (2003), Elsevier Science Publishers, Amsterdam
7. V. Capretta. Abstraction and Computation. PhD thesis, Katholieke Universiteit Nijmegen, Apr. 2002
8. Ciaffaglione A., and Di Gianantonio P. A certified, corecursive implementation of exact real numbers. Theoret. Comput. Sci. 351 1 (Feb. 2006) 39-51
9. The Coq Development Team. The Coq Proof Assistant Reference Manual, Version 8.0. INRIA (Apr. 2004). http://coq.inria.fr/doc/main.html [cited 19 May 2006]
10. Coquand T. Infinite objects in type theory. In: Barendregt H., and Nipkow T. (Eds). Types for Proofs and Programs. International Workshop TYPES'93, Nijmegen, The Netherlands, May 24-28, 1993. Lecture Notes in Comput. Sci. volume 806 (1994), Springer-Verlag 62-78 Selected Papers
11. Dijkstra E.W. On the productivity of recursive definitions. Personal note EWD 749. http://www.cs.utexas.edu/users/EWD/ewd07xx/EWD749.PDF [cited 19 May 2006], Sept. 1980
12. Dubois C., and Donzeau-Gouge V.V. A step towards the mechanization of partial functions: domains as inductive predicates. In: Kerber M. (Ed). Proc. Workshop on Mechanization of Partial Functions. July 5 1998, Lindau, Germany (1998) 53-62. ftp://ftp.cs.bham.ac.uk/pub/authors/M.Kerber/98-CADE-WS/dubois-donzeau.ps.gz [cited 19 May 2006]
13. Dybjer P. A general formulation of simultaneous inductive-recursive definitions in type theory. J. Symbolic Logic 65 2 (2000) 525-549
14. Edalat A., and Potts P.J. A new representation for exact real numbers. In: Brookes S., and Mislove M. (Eds). Mathematical Foundations of Programming Semantics. Thirteenth Annual Conference (MFPS XIII), Carnegie Mellon University, Pittsburgh, PA, USA, March 23-26, 1997. Electron. Notes Theor. Comput. Sci. volume 6 (1997), Elsevier Science Publishers
15. Escardó M.H., and Simpson A.K. A universal characterization of the closed Euclidean interval. Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science (2001), IEEE Computer Society 115-128
16. Geuvers H. Inductive and coinductive types with iteration and recursion. In: Nordström B., Pettersson K., and Plotkin G. (Eds). Informal Proc. of Workshop on Types for Proofs and Programs. Båstad, Sweden, 8-12 June 1992 (1992), Dept. of Computing Science, Chalmers Univ. of Technology and Göteborg Univ. 193-217. http://citeseer.ist.psu.edu/geuvers92inductive.html [cited 19 May 2006]
17. Giménez E. Codifying guarded definitions with recursive schemes. In: Dybjer P., Nordström B., and Smith J. (Eds). Types for Proofs and Programs. International Workshop TYPES'94, Båstad, Sweden, June 6-10, 1994. Lecture Notes in Comput. Sci. volume 996 (1995), Springer-Verlag 39-59 Selected Papers
18. E. Giménez. 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, Dec. 1996
19. R. W. Gosper. HAKMEM, Item 101 B. http://www.inwap.com/pdp10/hbaker/hakmem/cf.html#item101b, [cited 19 May 2006], Feb. 29 1972. MIT AI Laboratory Memo No. 239.
20. Johnstone P.T. Sketches of an Elephant. A Topos Theory Compendium. Oxford Logic Guides 2 44 (2002) Oxford University Press
21. Lenisa M. From set-theoretic coinduction to algebraic coinduction: Some results, some problems. In: Jacobs B., and Rutten J. (Eds). Proc. of 2nd Int. Wksh. on Coalgebraic Methods in Computer Science. CMCS'99, Amsterdam, The Netherlands, 20-21 March 1999. Electron. Notes Theor. Comput. Sci. volume 19 (1999), Elsevier Science Publishers, North-Holland
22. Martin-Löf P. Mathematics of infinity. In: Martin-Löf P., and Mints G. (Eds). COLOG-88. International Conference on Computer Logic, Tallinn, USSR, December 1988. Lecture Notes in Comput. Sci. volume 417 (1990), Springer-Verlag 149-197 Proceedings
23. M. Niqui. Formalising Exact Arithmetic: Representations, Algorithms and Proofs. PhD thesis, Radboud Universiteit Nijmegen, Sept. 2004
24. Niqui M. Formalising exact arithmetic in type theory. In: Cooper S.B., Löwe B., and Torenvliet L. (Eds). New Computational Paradigms: First Conference on Computability in Europe. CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005. Lecture Notes in Comput. Sci. volume 3526 (2005), Springer-Verlag 368-377 Proceedings
25. Niqui M. http://www.cs.ru.nl/~milad/ETrees/coinductive-field/ [cited 19 May 2006], Jan. 2006. Files under Coq 8.0pl3
26. Pattinson D. Computable functions on final coalgebras. Proc. of 6th Workshop on Coalgebraic Methods in Computer Science. CMCS'03, Warsaw, 5-6 Apr. 2003. Electron. Notes Theor. Comput. Sci. volume 82(1) (2003), Elsevier Science Publishers
27. C. Paulin-Mohring. Inductive definitions in the system Coq: Rules and properties. Research report RR 92-49, Laboratoire de l'Informatique du Parallélisme, Ecole normale supérieure de Lyon, Dec. 1992
28. D. Pavlović and M. H. Escardó. Calculus in coinductive form. In Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science, pages 408-417, 1998
29. Pavlović D., and Pratt V. On coalgebra of real numbers. In: Jacobs B., and Rutten J. (Eds). Coalgebraic Methods in Computer Science. CMCS'99. Electron. Notes Theor. Comput. Sci. volume 19 (2000), Elsevier Science Publishers 15 pages
30. P.J. Potts. Exact Real Arithmetic using Möbius Transformations. PhD thesis, University of London, Imperial College, July 1998
31. Uustalu T., and Vene V. Primitive (co)recursion and course-of-value (co)iteration, categorically. Informatica 10 1 (1999) 5-26