We provide an illustrative implementation of an analytic, infinitely-differentiable virtual machine, implementing infinitely-differentiable programming spaces and operators acting upon them, as constructed in the paper Operational calculus on programming spaces and generalized tensor networks[1]. Implementation closely follows theorems and derivations of the paper, intended as an educational guide. Analytic virtual machines allow nested transformations, with operational calculus opening new doors in program analysis. We outline the process of employing such a machine to several causes, seamlessly inter-weaving operational calculus and algorithmic control flow. Nothing at all takes place in the universe in which some rule of maximum or minimum does not appear.
[1]
Guillermo Sapiro,et al.
Geodesic Active Contours
,
1995,
International Journal of Computer Vision.
[2]
Barak A. Pearlmutter,et al.
Putting the Automatic Back into AD:Part II, Dynamic, Automatic, Nestable, and Fast(CVS: 1.1)
,
2008
.
[3]
D. Walton,et al.
Clothoid spline transition spirals
,
1992
.
[4]
Ziga Sajovic,et al.
Operational calculus on programming spaces and generalized tensor networks
,
2016,
ArXiv.
[5]
Tony F. Chan,et al.
Image processing and analysis - variational, PDE, wavelet, and stochastic methods
,
2005
.
[6]
Guillermo Sapiro,et al.
A Variational Framework for Exemplar-Based Image Inpainting
,
2011,
International Journal of Computer Vision.