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 language | English |
---|---|
Title of host publication | Proceedings - 13th Annual IEEE Symposium on Logic in Computer Science, LICS 1998 |
Publisher | Institute of Electrical and Electronics Engineers (IEEE) |
Pages | 408-417 |
Number of pages | 10 |
ISBN (Electronic) | 0818685069 |
DOIs | |
Publication status | Published - 1998 |
Event | 13th Annual IEEE Symposium on Logic in Computer Science, LICS 1998 - Indianapolis, United States Duration: 21 Jun 1998 → 24 Jun 1998 |
Publication series
Name | Proceedings - Symposium on Logic in Computer Science |
---|---|
Volume | 1998-June |
ISSN (Print) | 1043-6871 |
Conference
Conference | 13th Annual IEEE Symposium on Logic in Computer Science, LICS 1998 |
---|---|
Country/Territory | United States |
City | Indianapolis |
Period | 21/06/98 → 24/06/98 |
Bibliographical note
Publisher Copyright:© 1998 IEEE.
ASJC Scopus subject areas
- Software
- General Mathematics