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.
[1]
E. Phragmén,et al.
Sur une extension d'un théorème classique de la théorie des fonctions
,
1904
.
[2]
C. A. R. Hoare,et al.
Communicating sequential processes
,
1978,
CACM.
[3]
Robert L. Constable,et al.
Infinite Objects in Type Theory
,
1986,
LICS.
[4]
Robin Milner,et al.
Co-Induction in Relational Semantics
,
1991,
Theor. Comput. Sci..
[5]
Jan J. M. M. Rutten,et al.
Initial Algebra and Final Coalgebra Semantics for Concurrency
,
1993,
REX School/Symposium.
[6]
Dusko Pavlovic,et al.
Guarded induction on final coalgebras
,
1998,
CMCS.
[7]
E. C. Titchmarsh,et al.
The Laplace Transform
,
1991,
Heat Transfer 1.