{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T09:56:58Z","timestamp":1764842218280,"version":"3.40.3"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030171834"},{"type":"electronic","value":"9783030171841"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-17184-1_19","type":"book-chapter","created":{"date-parts":[[2019,4,6]],"date-time":"2019-04-06T21:34:04Z","timestamp":1554586444000},"page":"525-552","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Fixing Incremental Computation"],"prefix":"10.1007","author":[{"given":"Mario","family":"Alvarez-Picallo","sequence":"first","affiliation":[]},{"given":"Alex","family":"Eyers-Taylor","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Peyton Jones","sequence":"additional","affiliation":[]},{"given":"C.-H. Luke","family":"Ong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,6]]},"reference":[{"key":"19_CR1","volume-title":"Foundations of Databases: The Logical Level","author":"S Abiteboul","year":"1995","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases: The Logical Level. Addison-Wesley Longman Publishing Co., Inc., Boston (1995)"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Jung, A.: Domain theory. In: Handbook of Logic in Computer Science. Oxford University Press, New York (1994)","DOI":"10.1093\/oso\/9780198537625.003.0001"},{"key":"19_CR3","unstructured":"Alvarez-Picallo, M., Eyers-Taylor, A., Jones, M.P., Ong, C.L.: Fixing incremental computation: derivatives of fixpoints, and the recursive semantics of datalog. CoRR abs\/1811.06069 (2018). http:\/\/arxiv.org\/abs\/1811.06069"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Alvarez-Picallo, M., Ong, C.H.L.: Change actions: models of generalised differentiation. In: International Conference on Foundations of Software Science and Computation Structures. Springer (2019, in press)","DOI":"10.1007\/978-3-030-17127-8_3"},{"key":"19_CR5","unstructured":"Arntzenius, M.: Static differentiation of monotone fixpoints (2017). http:\/\/www.rntz.net\/files\/fixderiv.pdf"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Arntzenius, M., Krishnaswami, N.R.: Datafun: a functional datalog. In: Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, pp. 214\u2013227. ACM (2016)","DOI":"10.1145\/3022670.2951948"},{"key":"19_CR7","unstructured":"Avgustinov, P., de Moor, O., Jones, M.P., Sch\u00e4fer, M.: QL: object-oriented queries on relational data. In: LIPIcs-Leibniz International Proceedings in Informatics, vol. 56. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2016)"},{"key":"19_CR8","series-title":"Topics in Information Systems","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-1-4612-4980-1_17","volume-title":"On Knowledge Base Management Systems","author":"F Bancilhon","year":"1986","unstructured":"Bancilhon, F.: Naive evaluation of recursively defined relations. In: Brodie, M.L., Mylopoulos, J. (eds.) On Knowledge Base Management Systems. TINF, pp. 165\u2013178. Springer, New York (1986). https:\/\/doi.org\/10.1007\/978-1-4612-4980-1_17"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Bancilhon, F., Ramakrishnan, R.: An amateur\u2019s introduction to recursive query processing strategies, vol. 15. ACM (1986)","DOI":"10.1145\/16856.16859"},{"key":"19_CR10","unstructured":"Baydin, A.G., Pearlmutter, B.A.: Automatic differentiation of algorithms for machine learning. arXiv preprint arXiv:1404.7456 (2014)"},{"key":"19_CR11","unstructured":"Baydin, A.G., Pearlmutter, B.A., Siskind, J.M.: DiffSharp: an AD library for .NET languages. arXiv preprint arXiv:1611.03423 (2016)"},{"key":"19_CR12","unstructured":"Blute, R., Ehrhard, T., Tasson, C.: A convenient differential category. arXiv preprint arXiv:1006.3140 (2010)"},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.entcs.2010.08.013","volume":"265","author":"A Bucciarelli","year":"2010","unstructured":"Bucciarelli, A., Ehrhard, T., Manzonetto, G.: Categorical models for simply typed resource calculi. Electron. Notes Theor. Comput. Sci. 265, 213\u2013230 (2010)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Cai, Y., Giarrusso, P.G., Rendel, T., Ostermann, K.: A theory of changes for higher-order languages: incrementalizing $$\\lambda $$ -calculi by static differentiation. In: ACM SIGPLAN Notices, vol. 49, pp. 145\u2013155. ACM (2014)","DOI":"10.1145\/2666356.2594304"},{"issue":"POPL","key":"19_CR15","doi-asserted-by":"publisher","first-page":"11:1","DOI":"10.1145\/3158099","volume":"2","author":"T Cathcart Burn","year":"2018","unstructured":"Cathcart Burn, T., Ong, C.L., Ramsay, S.J.: Higher-order constrained horn clauses for verification. PACMPL 2(POPL), 11:1\u201311:28 (2018). https:\/\/doi.org\/10.1145\/3158099","journal-title":"PACMPL"},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.entcs.2016.09.032","volume":"325","author":"JRB Cockett","year":"2016","unstructured":"Cockett, J.R.B., Gallagher, J.: Categorical models of the differential $$\\lambda $$ -calculus revisited. Electron. Notes Theor. Comput. Sci. 325, 63\u201383 (2016)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"1","key":"19_CR17","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(94)90091-4","volume":"131","author":"KJ Compton","year":"1994","unstructured":"Compton, K.J.: Stratified least fixpoint logic. Theor. Comput. Sci. 131(1), 95\u2013120 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR18","unstructured":"Datomic website (2018). https:\/\/www.datomic.com . Accessed 01 Jan 2018"},{"issue":"1","key":"19_CR19","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1145\/344788.344808","volume":"29","author":"G Dong","year":"2000","unstructured":"Dong, G., Su, J.: Incremental maintenance of recursive views using relational calculus\/SQL. ACM SIGMOD Rec. 29(1), 44\u201351 (2000)","journal-title":"ACM SIGMOD Rec."},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Ehrhard, T.: An introduction to differential linear logic: proof-nets, models and antiderivatives. Math. Struct. Comput. Sci. 1\u201366 (2017)","DOI":"10.1017\/S0960129516000372"},{"issue":"1\u20133","key":"19_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(03)00392-X","volume":"309","author":"T Ehrhard","year":"2003","unstructured":"Ehrhard, T., Regnier, L.: The differential lambda-calculus. Theor. Comput. Sci. 309(1\u20133), 1\u201341 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"ICFP","key":"19_CR22","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/3236765","volume":"2","author":"C Elliott","year":"2018","unstructured":"Elliott, C.: The simple essence of automatic differentiation. Proc. ACM Program. Lang. 2(ICFP), 70 (2018)","journal-title":"Proc. ACM Program. Lang."},{"key":"19_CR23","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898717761","volume-title":"Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation","author":"A Griewank","year":"2008","unstructured":"Griewank, A., Walther, A.: Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation, vol. 105. SIAM, Philadelphia (2008)"},{"key":"19_CR24","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1109\/69.599937","volume":"3","author":"T Griffin","year":"1997","unstructured":"Griffin, T., Libkin, L., Trickey, H.: An improved algorithm for the incremental recomputation of active relational expressions. IEEE Trans. Knowl. Data Eng. 3, 508\u2013511 (1997)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"19_CR25","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1145\/170036.170066","volume":"22","author":"A Gupta","year":"1993","unstructured":"Gupta, A., Mumick, I.S., Subrahmanian, V.S.: Maintaining views incrementally. ACM SIGMOD Rec. 22(2), 157\u2013166 (1993)","journal-title":"ACM SIGMOD Rec."},{"key":"19_CR26","doi-asserted-by":"publisher","DOI":"10.1201\/b17711","volume-title":"LogiQL: A Query Language for Smart Databases","author":"T Halpin","year":"2014","unstructured":"Halpin, T., Rugaber, S.: LogiQL: A Query Language for Smart Databases. CRC Press, Boca Raton (2014)"},{"key":"19_CR27","unstructured":"Harrison, J.V., Dietrich, S.W.: Maintenance of materialized views in a deductive database: an update propagation approach. In: Workshop on Deductive Databases, JICSLP, pp. 56\u201365 (1992)"},{"key":"19_CR28","unstructured":"Kelly, R., Pearlmutter, B.A., Siskind, J.M.: Evolving the incremental $$\\lambda $$ calculus into a model of forward automatic differentiation (AD). arXiv preprint arXiv:1611.03429 (2016)"},{"key":"19_CR29","doi-asserted-by":"crossref","unstructured":"Kerjean, M., Tasson, C.: Mackey-complete spaces and power series-a topological model of differential linear logic. Math. Struct. Comput. Sci. 1\u201336 (2016)","DOI":"10.1017\/S0960129516000281"},{"key":"19_CR30","doi-asserted-by":"publisher","DOI":"10.1515\/9783110812909","volume-title":"Monoids, Acts and Categories: With Applications to Wreath Products and Graphs. A Handbook for Students and Researchers","author":"M Kilp","year":"2000","unstructured":"Kilp, M., Knauer, U., Mikhalev, A.V.: Monoids, Acts and Categories: With Applications to Wreath Products and Graphs. A Handbook for Students and Researchers, vol. 29. Walter de Gruyter, Berlin (2000)"},{"issue":"1","key":"19_CR31","first-page":"430","volume":"18","author":"A Kucukelbir","year":"2017","unstructured":"Kucukelbir, A., Tran, D., Ranganath, R., Gelman, A., Blei, D.M.: Automatic differentiation variational inference. J. Mach. Learn. Res. 18(1), 430\u2013474 (2017)","journal-title":"J. Mach. Learn. Res."},{"key":"19_CR32","unstructured":"LogicBlox Inc. website (2018). http:\/\/www.logicblox.com . Accessed 01 Jan 2018"},{"key":"19_CR33","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/j.entcs.2012.08.017","volume":"286","author":"O Manzyuk","year":"2012","unstructured":"Manzyuk, O.: A simply typed $$\\lambda $$ -calculus of forward automatic differentiation. Electron. Notes Theor. Comput. Sci. 286, 257\u2013272 (2012)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"19_CR34","unstructured":"de Moor, O., Baars, A.: Doing a doaitse: simple recursive aggregates in datalog. In: Liber Amicorum for Doaitse Swierstra, pp. 207\u2013216 (2013). http:\/\/www.staff.science.uu.nl\/~hage0101\/liberdoaitseswierstra.pdf . Accessed 01 Jan 2018"},{"issue":"3","key":"19_CR35","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/69.91063","volume":"3","author":"X Qian","year":"1991","unstructured":"Qian, X., Wiederhold, G.: Incremental recomputation of active relational expressions. IEEE Trans. Knowl. Data Eng. 3(3), 337\u2013341 (1991)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"19_CR36","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.entcs.2011.02.011","volume":"271","author":"F S\u00e1enz-P\u00e9rez","year":"2011","unstructured":"S\u00e1enz-P\u00e9rez, F.: DES: a deductive database system. Electron. Notes Theor. Comput. Sci. 271, 63\u201378 (2011)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"19_CR37","doi-asserted-by":"crossref","unstructured":"Sch\u00e4fer, M., de Moor, O.: Type inference for datalog with complex type hierarchies. In: ACM SIGPLAN Notices, vol. 45, pp. 145\u2013156. ACM (2010)","DOI":"10.1145\/1707801.1706317"},{"key":"19_CR38","doi-asserted-by":"crossref","unstructured":"Scholz, B., Jordan, H., Suboti\u0107, P., Westmann, T.: On fast large-scale program analysis in datalog. In: Proceedings of the 25th International Conference on Compiler Construction, pp. 196\u2013206. ACM (2016)","DOI":"10.1145\/2892208.2892226"},{"key":"19_CR39","unstructured":"Semmle Ltd. website (2018). https:\/\/semmle.com . Accessed 01 Jan 2018"},{"key":"19_CR40","doi-asserted-by":"crossref","unstructured":"Sereni, D., Avgustinov, P., de Moor, O.: Adding magic to an optimising datalog compiler. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, pp. 553\u2013566. ACM (2008)","DOI":"10.1145\/1376616.1376673"},{"issue":"4","key":"19_CR41","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s10990-008-9037-1","volume":"21","author":"JM Siskind","year":"2008","unstructured":"Siskind, J.M., Pearlmutter, B.A.: Nesting forward-mode AD in a functional framework. High.-Order Symb. Comput. 21(4), 361\u2013376 (2008)","journal-title":"High.-Order Symb. Comput."},{"key":"19_CR42","unstructured":"Souffle language website (2018). http:\/\/souffle-lang.org . Accessed 01 Jan 2018"},{"key":"19_CR43","unstructured":"Urpi, T., Olive, A.: A method for change computation in deductive databases. In: VLDB, vol. 92, pp. 225\u2013237 (1992)"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17184-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T17:46:40Z","timestamp":1721152000000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-17184-1_19"}},"subtitle":["Derivatives of Fixpoints, and the Recursive Semantics of Datalog"],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030171834","9783030171841"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17184-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esop2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.etaps.org\/2019\/esop","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"86","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"28","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3,2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"12","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}