U. A. Acar, Self-Adjusting Computation, 2005.
URL : https://hal.archives-ouvertes.fr/hal-01100346

U. A. Acar, Self-adjusting computation: (an overview), PEPM, pp.1-6, 2009.

U. A. Acar, A. Ahmed, and M. Blume, Imperative self-adjusting computation, Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp.309-322, 2008.

A. Ahmed, Step-indexed syntactic logical relations for recursive and quantified types, Programming Languages and Systems, pp.69-83, 2006.

A. W. Appel and D. Mcallester, An indexed model of recursive types for foundational proof-carrying code, ACM Trans. Program. Lang. Syst, vol.23, issue.5, pp.657-683, 2001.

J. A. Blakeley, P. A. Larson, and F. W. Tompa, Efficiently updating materialized views, SIGMOD, pp.61-71, 1986.

Y. Cai, P. G. Giarrusso, T. Rendel, and K. Ostermann, A theory of changes for higher-order languages -incrementalizing ?-calculi by static differentiation, Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2014.

E. Çiçek, Z. Paraskevopoulou, and D. Garg, A type theory for incremental computational complexity with control flow changes, Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, pp.132-145, 2016.

D. Firsov and W. Jeltsch, Purely functional incremental computing, Programming Languages, pp.62-77, 2016.

P. G. Giarrusso, Optimizing and Incrementalizing Higher-order Collection Queries by AST Transformation, 2018.

A. Gupta and I. S. Mumick, Maintenance of materialized views: problems, techniques, and applications, Materialized views, pp.145-157, 1999.

M. A. Hammer, J. Dunfield, D. J. Economou, and M. Narasimhamurthy, Typed Adapton: refinement types for incremental computations with precise names, 2016.

M. A. Hammer, J. Dunfield, K. Headley, N. Labich, J. S. Foster et al., Incremental computation with names, Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications, pp.748-766, 2015.

M. A. Hammer, K. Y. Phang, M. Hicks, and J. S. Foster, Adapton: composable, demand-driven incremental computation, Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation, pp.156-166, 2014.

T. Johnsson, Lambda lifting: transforming programs to recursive equations, 201 in Lecture Notes in Computer Science, pp.190-203, 1985.

C. Koch, Incremental query evaluation in a ring of databases, Symp. Principles of Database Systems (PODS), pp.87-98, 2010.

C. Koch, Y. Ahmad, O. Kennedy, M. Nikolic, A. Nötzli et al., DBToaster: higher-order delta processing for dynamic, frequently fresh views, The VLDB Journal, vol.23, issue.2, pp.253-278, 2014.

C. Koch, D. Lupei, and V. Tannen, Incremental view maintenance for collection programming, Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. pp. 75-90. PODS '16, 2016.

Y. A. Liu, Efficiency by incrementalization: an introduction, HOSC, vol.13, issue.4, pp.289-313, 2000.

Y. A. Liu and T. Teitelbaum, Caching intermediate results for program improvement, Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, pp.190-201, 1995.

B. O'sullivan, criterion: a Haskell microbenchmarking library, 2014.

R. Paige and S. Koenig, Finite differencing of computable expressions, TOPLAS, vol.4, issue.3, pp.402-454, 1982.

A. Rossberg, C. V. Russo, and D. Dreyer, F-ing modules, Proceedings of the 5th ACM SIGPLAN Workshop on Types in Language Design and Implementation, pp.89-102, 2010.

A. Sabry and M. Felleisen, Reasoning about programs in continuation-passing style, Lisp and symbolic computation, vol.6, issue.3-4, pp.289-360, 1993.

I. Sergey, D. Vytiniotis, and S. Peyton-jones, Modular, higher-order cardinality analysis in theory and practice, Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.335-347, 2014.

, The Coq development team: The Coq proof assistant reference manual, 2018.

F. Wang, X. Wu, G. Essertel, J. Decker, and T. Rompf, Demystifying differentiable programming: Shift/reset the penultimate backpropagator

, T (dE ) 1

T. De,