Induction and recursion on the partial real line with applications to Real PCF

Theoretical Computer Science

Volumn 210, Issue 1, 1999, Pages 121-157

  Escardó, Martín Hötzel ^a   Streicher, Thomas ^b  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Coinduction; Domain theory; Exact real number computation; Induction; Real PCF; Universality

Indexed keywords

EID: 0000650008     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00099-1     Document Type: Article

References (36)

1. S. Abramsky, A. Jung, Domain theory, in: S. Abramsky, D.M. Gabbay, T.S.E. Maibaum, (Eds.), Handbook of Logic in Computer Science, vol. 3, Clarendon Press, Oxford, 1994, pp. 1-168.
2. J. Adamek, H. Herrlich, G.E. Strecker, Abstract and Concrete Categories, Wiley, New York, 1990.
3. R. Bird, P. Wadler, Introduction to Functional Programming, Prentice-Hall, New York, 1988.
4. A. Edalat, M.H. Escardó, Integration in Real PCF (extended abstract), in: Proc. 11th Annual IEEE Symp. on Logic in Computer Science, New Brunswick, New Jersey, USA, July 1996, pp. 382-393.
5. A. Edalat, Ph. Sünderhauf, A domain-theoretic approach to computability on the real line, Theoret. Comput. Sci., this issue.
6. H. Egli, R.L. Constable, Computability concepts for programming languages, Theoret. Comput. Sci. 2 (1976) 133-145.
7. M.H. Escardó, Properly injective spaces and function spaces, Topology and its Applications 89 (1998) to appear.
8. M.H. Escardó, Induction and recursion on the real line, in: C. Hankin, I. Mackie, R. Nagarajan (Eds.), Theory and Formal Methods 1994, Proc. 2nd Imperial College Department of Computing Workshop on Theory and Formal Methods, Miller Centre, Cambridge, 11-14 September 1994, IC Press, 1995, pp. 259-282.
9. M.H. Escardó, PCF extended with real numbers, Theoret. Comput. Sci. 162 (1) (1996) 79-115.
10. M.H. Escardó, Real PCF extended with ∃ is universal, in: A. Edalat, S. Jourdan, G. McCusker (Eds.), Advances in Theory and Formal Methods of Computing. Proc. 3rd Imperial College Workshop, April 1996, Christ Church, Oxford, IC Press, 1996, pp. 13-24.
11. M.H. Escardó, PCF extended with real numbers: a domain-theoretic approach to higher-order exact real number computation, Technical Report ECS-LFCS-97-374, Department of Computer Science, University of Edinburgh; 1997; Ph.D. thesis, Imperial College of the University of London, 1997.
12. M.H. Escardó, T. Streicher, Induction and recursion on the partial real line via biquotients of bifree algebras (extended abstract), in: Proc. 12th Annual IEEE Symp. on Logic in Computer Science, Warsaw, Poland, June 1997.
13. M.P. Fiore, A coinduction principle for recursive data types based on bisimulation, Inform. Comput. 127 (2) (1996) 186-198.
14. P.J. Freyd, Algebraically complete categories, Lecture Notes in Mathematics, vol. 1488 Springer, Berlin, (1991) pp. 95-104.
15. P.J. Freyd, Remarks on algebraically compact categories, in: M.P. Fourman, P.T. Johnstone, A.M. Pitts (Eds.), Applications of Categories in Computer Science: Proc. LMS Symp. Durham, 1991, LMS Lecture Notes Series, vol. 177, Cambridge University Press, Cambridge, 1992.
16. G. Gierz, K.H. Hofmann, K. Keimel, J.D. Lawson, M. Mislove, D.S. Scott, A Compendium of Continuous Lattices, Springer, New York, 1980.
17. M.J. Gordon, R. Milner, C.P. Wadsworth, Edinburgh LCF, Lecture Notes in Computer Science, vol. 78, Springer, Berlin, 1979.
18. C.A. Gunter, Semantics of Programming Languages - Structures and Techniques, MIT Press, London, 1992.
19. A. Kanda, D. Park, When are two effectively given domains identical? in: K. Weihrauch, (Ed.), Theoretical Computer Science 4th GI Conf., Lecture Notes in Computer Science, 1979.
20. D.J. Lehmann, M.B. Smyth, Algebraic specification of data types: a synthetic approach, Math. System Theory 14 (1981) 97-139.
21. R.E. Moore, Interval Analysis, Prentice-Hall, Englewood Cliffs, 1966.
22. G. Plotkin, LCF considered as a programming language, Theoret. Comput. Sci. 5 (1) (1977) pp. 223-255.
23. ω as a universal domain, J. Comput. System Sci. 17 (1978) 209-236.
24. G. Plotkin, Domains, Post-graduate Lectures in advanced domain theory, University of Edinburgh, Department of Computer Science. http:// ida.dcs.qmw.ac.uk/ sites/ other/ domain.notes.other, 1980.
25. A. Poigné, Basic category theory, in: S. Abramsky, D.M. Gabbay, T.S.E. Maibaum (Eds.), Handbook of Logic in Computer Science, vol. 1, Clarendon Press, Oxford, 1992, pp. 413-640.
26. H.L. Royden, Real Analysis, 3rd Ed., Collier Macmillan Publishing, 1988.
27. D.S. Scott, Continuous lattices, in: F.W. Lawvere (Ed.), Toposes, Algebraic Geometry and Logic, vol. 274 Lectures Notes in Mathematics, Springer, Berlin, 1972, pp. 97-136.
28. D.S. Scott, Lattice theory, data types and semantics, Formal semantics of programming languages, Prentice-Hall, Englewood Cliffs, 1972, pp. 66-106.
29. D.S. Scott, A type-theoretical alternative to CUCH, ISWIM and OWHY, Theoret. Comput. Sci. 121 (1993) 411-440. (reprint a manuscript produced in 1969).
30. M.B. Smyth, Effectively given domains, Theoret. Comput. Sci. 5 (1) (1977) 256-274.
31. M.B. Smyth, Power domains and predicate transformers: a topological view, in: J. Diaz (Ed.) Automata, Languages and Programming, Lecture Notes in Computer Science, Springer, Berlin, 1983, pp. 662-675.
32. M.B. Smyth, I-categories and duality, in: M.P. Fourman, P.T. Johnstone, A.M. Pitts (Eds.) Applications of Categories in Computer Science, Cambridge, 1992, Mathematical Society Lecture Notes Series 177, Cambridge University Press, London, pp. 270-287.
33. M.B. Smyth, Topology, in: S. Abramsky, D.M. Gabbay, T.S.E. Maibaum, (Eds.), Handbook of Logic in Computer Science, vol. 1, Clarendon Press, Oxford, 1992, pp. 641-761.
34. M.B. Smyth, G. Plotkin, The category-theoretic solution of recursive domain equations, SIAM J. Comput. 11 (4) (1982) 761-783.
35. R. Stoll, Set Theory and Logic, Freeman, San Fransisco, 1966.
36. T. Streicher, A universality theorem for PCF with recursive types, parallel-or and ∃, Math. Struct. Comput. Sci. 4 (1) (1994) 111-115.