• DocumentCode
    3299797
  • Title

    Induction and recursion on the partial real line via biquotients of bifree algebras

  • Author

    Escardó, Martín Hötzel ; Streicher, Thomas

  • Author_Institution
    Dept. of Comput., Imperial Coll. of Sci., Technol. & Med., London, UK
  • fYear
    1997
  • fDate
    29 Jun-2 Jul 1997
  • Firstpage
    376
  • Lastpage
    386
  • Abstract
    The partial real line is the continuous domain of compact real intervals ordered by reverse inclusion. The idea is that singleton intervals represent total real numbers, and that the remaining intervals represent partial real numbers. The partial real line has been used to model exact real number computation in the framework of the programming language Real PCF. We introduce induction principles and recursion schemes for the partial unit interval, which allows us to verify that Real PCF programs meet their specification. The theory is based on a domain-equation-like presentation of the partial unit interval, which we refer to as a biquotient of a bifree algebra
  • Keywords
    algebra; formal logic; program verification; Real PCF; bifree algebras; biquotients; compact real intervals; domain-equation-like presentation; exact real number computation; induction; induction principles; partial real line; partial unit interval; recursion; recursion schemes; reverse inclusion; singleton intervals; specification; Algebra; Computer languages; Educational institutions; Equations; Topology;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Logic in Computer Science, 1997. LICS '97. Proceedings., 12th Annual IEEE Symposium on
  • Conference_Location
    Warsaw
  • ISSN
    1043-6871
  • Print_ISBN
    0-8186-7925-5
  • Type

    conf

  • DOI
    10.1109/LICS.1997.614963
  • Filename
    614963