{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T00:48:46Z","timestamp":1775868526563,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,1,17]],"date-time":"2010-01-17T00:00:00Z","timestamp":1263686400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,1,17]]},"DOI":"10.1145\/1706299.1706327","type":"proceedings-article","created":{"date-parts":[[2010,1,19]],"date-time":"2010-01-19T15:15:04Z","timestamp":1263914104000},"page":"223-236","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":71,"title":["Static determination of quantitative resource usage for higher-order programs"],"prefix":"10.1145","author":[{"given":"Steffen","family":"Jost","sequence":"first","affiliation":[{"name":"University of St Andrews, St Andrews, United Kingdom"}]},{"given":"Kevin","family":"Hammond","sequence":"additional","affiliation":[{"name":"University of St Andrews, St Andrews, United Kingdom"}]},{"given":"Hans-Wolfgang","family":"Loidl","sequence":"additional","affiliation":[{"name":"Ludwig-Maximilians University, Munich, Germany"}]},{"given":"Martin","family":"Hofmann","sequence":"additional","affiliation":[{"name":"Ludwig-Maximilians University, Munich, Germany"}]}],"member":"320","published-online":{"date-parts":[[2010,1,17]]},"reference":[{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542431.1542450"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796800003865"},{"key":"e_1_3_2_1_4_1","unstructured":"M. Berkelaar K. Eikland and P. Notebaert. lp solve: Open Source (Mixed-Integer) Linear Programming System. Published under GNU LGPL (Lesser General Public Licence). http:\/\/lpsolve.sourceforge.net\/5.5.  M. Berkelaar K. Eikland and P. Notebaert. lp solve: Open Source (Mixed-Integer) Linear Programming System. Published under GNU LGPL (Lesser General Public Licence). http:\/\/lpsolve.sourceforge.net\/5.5."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/781131.781153"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00590-9_14"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1012996816178"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375634.1375656"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/325694.325716"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328457"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/646787.703893"},{"key":"e_1_3_2_1_12_1","first-page":"31","volume-title":"Proc. LCTES'98: Conf. on Languages, Compilers and Tools for Embedded Systems, LNCS 1474","author":"Gomez G.","year":"1998","unstructured":"G. Gomez and Y. Liu . Automatic Time-Bound Analysis for a Higher-Order Language . In Proc. LCTES'98: Conf. on Languages, Compilers and Tools for Embedded Systems, LNCS 1474 , pages 31 -- 40 ,Montreal, Canada , June 1998 . Springer. G. Gomez and Y. Liu. Automatic Time-Bound Analysis for a Higher-Order Language. In Proc. LCTES'98: Conf. on Languages, Compilers and Tools for Embedded Systems, LNCS 1474, pages 31--40,Montreal, Canada, June 1998. Springer."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480898"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/954186.954189"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/169701.169692"},{"key":"e_1_3_2_1_16_1","unstructured":"J. Hoffmann and M. Hofmann. Amortized Resource Analysis with Polynomial Potential. In preparation.  J. Hoffmann and M. Hofmann. Amortized Resource Analysis with Polynomial Potential. In preparation."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/763845.763847"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/503272.503297"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/604131.604148"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/182409.182442"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/317636.317785"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/237721.240882"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/360204.375719"},{"key":"e_1_3_2_1_24_1","first-page":"321","volume-title":"Algorithmic Languages","author":"Jonkers H.","year":"1981","unstructured":"H. Jonkers . Abstract Storage Structures . In Algorithmic Languages , pages 321 -- 343 . IFIP, North Holland , 1981 . H. Jonkers. Abstract Storage Structures. In Algorithmic Languages, pages 321--343. IFIP, North Holland, 1981."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-05089-3_23"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/169701.169687"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/158511.158618"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/42190.42347"},{"key":"e_1_3_2_1_29_1","first-page":"99","volume-title":"Parametric Worst-Case Execution Time Analysis. In Proc. WCET '03: Intl. Workshop on Worst-Case Execution Time Analysis","author":"Lisper B.","year":"2003","unstructured":"B. Lisper . Fully Automatic , Parametric Worst-Case Execution Time Analysis. In Proc. WCET '03: Intl. Workshop on Worst-Case Execution Time Analysis , pages 99 -- 102 , 2003 . B. Lisper. Fully Automatic, Parametric Worst-Case Execution Time Analysis. In Proc. WCET '03: Intl. Workshop on Worst-Case Execution Time Analysis, pages 99--102, 2003."},{"key":"e_1_3_2_1_30_1","volume-title":"Proc. FOPARA '09: Intl. Workshop on Foundational and Practical Aspects of Resource Analysis","author":"Loidl H.-W.","year":"2009","unstructured":"H.-W. Loidl and S. Jost . Improvements to a Resource Analysis for Hume . In Proc. FOPARA '09: Intl. Workshop on Foundational and Practical Aspects of Resource Analysis , Nov. 2009 . Submitted. H.-W. Loidl and S. Jost. Improvements to a Resource Analysis for Hume. In Proc. FOPARA '09: Intl. Workshop on Foundational and Practical Aspects of Resource Analysis, Nov. 2009. Submitted."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/280586"},{"key":"e_1_3_2_1_32_1","first-page":"109","volume-title":"Proc TFP'06: Symp. on Trends in Functional Programming","author":"Pena R.","year":"2006","unstructured":"R. Pena , C. Segura , and M. Montenegro . A Sharing Analysis for Safe . In Proc TFP'06: Symp. on Trends in Functional Programming , pages 109 -- 128 , Nottingham, UK , Apr. 2006 . Intellect. R. Pena, C. Segura, and M. Montenegro. A Sharing Analysis for Safe. In Proc TFP'06: Symp. on Trends in Functional Programming, pages 109--128, Nottingham, UK, Apr. 2006. Intellect."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/800194.805852"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1040305.1040330"},{"key":"e_1_3_2_1_35_1","first-page":"351","volume-title":"Eekelen. Polynomial Size Analysis of First-Order Functions. In Proc. TLCA 2007: Intl. Conf. on Typed Lambda Calculi and Applications, LNCS 4583","author":"Shkaravska O.","year":"2007","unstructured":"O. Shkaravska , R. van Kesteren , and M. van Eekelen. Polynomial Size Analysis of First-Order Functions. In Proc. TLCA 2007: Intl. Conf. on Typed Lambda Calculi and Applications, LNCS 4583 , pages 351 -- 365 , Paris, France , June 2007 . Springer. O. Shkaravska, R. van Kesteren, and M. van Eekelen. Polynomial Size Analysis of First-Order Functions. In Proc. TLCA 2007: Intl. Conf. on Typed Lambda Calculi and Applications, LNCS 4583, pages 351--365, Paris, France, June 2007. Springer."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45212-6_22"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/0606031"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27861-0_6"},{"key":"e_1_3_2_1_40_1","first-page":"177","volume-title":"Proc. TIL'00: Types in Compilation, LNCS 2071","author":"Walker D.","year":"2000","unstructured":"D. Walker and G. Morrisett . Alias Types for Recursive Data Structures . In Proc. TIL'00: Types in Compilation, LNCS 2071 , pages 177 -- 206 . Springer , 2000 . D. Walker and G. Morrisett. Alias Types for Recursive Data Structures. In Proc. TIL'00: Types in Compilation, LNCS 2071, pages 177--206. Springer, 2000."}],"event":{"name":"POPL '10: The 37th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"Madrid Spain","acronym":"POPL '10","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1706299.1706327","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1706299.1706327","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:26:19Z","timestamp":1750263979000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1706299.1706327"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,17]]},"references-count":38,"alternative-id":["10.1145\/1706299.1706327","10.1145\/1706299"],"URL":"https:\/\/doi.org\/10.1145\/1706299.1706327","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1707801.1706327","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2010,1,17]]},"assertion":[{"value":"2010-01-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}