Calculus in coinductive form

D. Pavlović, M. H. Escardó

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish
Title of host publicationProceedings - 13th Annual IEEE Symposium on Logic in Computer Science, LICS 1998
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages408-417
Number of pages10
ISBN (Electronic)0818685069
DOIs
Publication statusPublished - 1998
Event13th Annual IEEE Symposium on Logic in Computer Science, LICS 1998 - Indianapolis, United States
Duration: 21 Jun 199824 Jun 1998

Publication series

NameProceedings - Symposium on Logic in Computer Science
Volume1998-June
ISSN (Print)1043-6871

Conference

Conference13th Annual IEEE Symposium on Logic in Computer Science, LICS 1998
Country/TerritoryUnited States
CityIndianapolis
Period21/06/9824/06/98

Bibliographical note

Publisher Copyright:
© 1998 IEEE.

ASJC Scopus subject areas

  • Software
  • General Mathematics

Fingerprint

Dive into the research topics of 'Calculus in coinductive form'. Together they form a unique fingerprint.

Cite this