• DocumentCode
    1958079
  • Title

    Calculus in coinductive form

  • Author

    Pavlovic, D. ; Escardo, M.H.

  • Author_Institution
    Kestrel Inst., Palo Alto, CA, USA
  • fYear
    1998
  • fDate
    21-24 Jun 1998
  • Firstpage
    408
  • Lastpage
    417
  • Abstract
    Coinduction is often seen as a way of implementing infinite objects. Since real numbers are typical infinite objects, it may not come as a surprise that calculus, when presented in a suitable way, is permeated by coinductive reasoning. What is surprising is that mathematical techniques, recently developed in the context of computer science, seem to be shedding a new light on some basic methods of calculus. We introduce a coinductive formalization of elementary calculus that can be used as a tool for symbolic computation, and geared towards computer algebra and theorem proving. So far, we have covered parts of ordinary differential and difference equations, Taylor series, Laplace transform and the basics of the operator calculus
  • Keywords
    process algebra; symbol manipulation; theorem proving; calculus; coinduction; computer algebra; symbolic computation; theorem proving; Algebra; Calculus; Computer science; Integral equations; Laplace equations; Tail; Taylor series;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Logic in Computer Science, 1998. Proceedings. Thirteenth Annual IEEE Symposium on
  • Conference_Location
    Indianapolis, IN
  • ISSN
    1043-6871
  • Print_ISBN
    0-8186-8506-9
  • Type

    conf

  • DOI
    10.1109/LICS.1998.705675
  • Filename
    705675