{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:18:45Z","timestamp":1725743925899},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642404467"},{"type":"electronic","value":"9783642404474"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40447-4_4","type":"book-chapter","created":{"date-parts":[[2013,8,5]],"date-time":"2013-08-05T21:00:39Z","timestamp":1375736439000},"page":"53-68","source":"Crossref","is-referenced-by-count":2,"title":["Higher-Order Size Checking without Subtyping"],"prefix":"10.1007","author":[{"given":"Attila","family":"G\u00f3bi","sequence":"first","affiliation":[]},{"given":"Olha","family":"Shkaravska","sequence":"additional","affiliation":[]},{"given":"Marko","family":"van Eekelen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Shkaravska, O., van Eekelen, M.C.J.D., van Kesteren, R.: Polynomial size analysis of first-order shapely functions. Logical Methods in Computer Science\u00a05(2) (2009)","DOI":"10.2168\/LMCS-5(2:10)2009"},{"key":"4_CR2","unstructured":"G\u00f3bi, A., Shkaravska, O., van Eekelen, M.: Size analysis of higher-order functions. In: Pe\u00f1a, R., van Eekelen, M. (eds.) Proceedings of the 12th International Symposium on Trends in Functional Programming, TFP 2011. LNCS, vol.\u00a07193, pp. 77\u201391 (2011); Also: Tech. Rep. SIC-07\/11"},{"key":"4_CR3","unstructured":"Erkok, L.: SMT Based Verification: Symbolic Haskell theorem prover using SMT solving"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L. Moura de","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.S.: Z3: An efficient smt solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol.\u00a04963, pp. 337\u2013340. Springer, Heidelberg (2008)"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/11964681_5","volume-title":"Implementation and Application of Functional Languages","author":"E. Brady","year":"2006","unstructured":"Brady, E., Hammond, K.: A dependently typed framework for static analysis of program execution costs. In: Butterfield, A., Grelck, C., Huch, F. (eds.) IFL 2005. LNCS, vol.\u00a04015, pp. 74\u201390. Springer, Heidelberg (2006)"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1145\/1328438.1328457","volume-title":"Proceedings of the 35th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2008","author":"N.A. Danielsson","year":"2008","unstructured":"Danielsson, N.A.: Lightweight semiformal time complexity analysis for purely functional data structures. In: Proceedings of the 35th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2008, pp. 133\u2013144. ACM, New York (2008)"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Hughes, J., Pareto, L., Sabry, A.: Proving the correctness of reactive systems using sized types. In: Proceedings of the 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1996, St. Petersburg Beach, Florida, USA, pp. 410\u2013423. ACM (1996)","DOI":"10.1145\/237721.240882"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Hughes, J., Pareto, L.: Recursion and dynamic data structures in bounded space: Towards embedded ML programming. In: Proceedings of the 4th ACM SIGPLAN International Conference on Functional Programming, ICFP 1999, Paris, France, pp. 70\u201381. ACM (1999)","DOI":"10.1145\/317765.317785"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1023\/A:1012996816178","volume":"14","author":"W.N. Chin","year":"2001","unstructured":"Chin, W.N., Khoo, S.C.: Calculating sized types. Higher-Order and Symbolic Computation\u00a014, 261\u2013300 (2001)","journal-title":"Higher-Order and Symbolic Computation"},{"key":"4_CR10","unstructured":"Abel, A.: Miniagda: Integrating sized and dependent types. In: Bove, A., Komendantskaya, E., Niqui, M. (eds.) Workshop on Partiality And Recursion in Interative Theorem Provers, PAR 2010, Satellite Workshop of ITP 2010 at FLoC (2010)"},{"key":"4_CR11","unstructured":"Abel, A.: A Polymorphic Lambda-Calculus with Sized Higher-Order Types. PhD thesis, Ludwig-Maximilians University, Munich (2006)"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-540-27861-0_6","volume-title":"Implementation of Functional Languages","author":"P.B. Vasconcelos","year":"2004","unstructured":"Vasconcelos, P.B., Hammond, K.: Inferring cost equations for recursive, polymorphic and higher-order functional programs. In: Trinder, P., Michaelson, G.J., Pe\u00f1a, R. (eds.) IFL 2003. LNCS, vol.\u00a03145, pp. 86\u2013101. Springer, Heidelberg (2004)"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-642-15331-0_6","volume-title":"Foundational and Practical Aspects of Resource Analysis","author":"J. Avery","year":"2010","unstructured":"Avery, J., Kristiansen, L., Moyen, J.Y.: Static complexity analysis of higher order programs. In: van Eekelen, M., Shkaravska, O. (eds.) FOPARA 2009. LNCS, vol.\u00a06324, pp. 84\u201399. Springer, Heidelberg (2010)"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1145\/1707801.1706327","volume":"45","author":"S. Jost","year":"2010","unstructured":"Jost, S., Hammond, K., Loidl, H.W., Hofmann, M.: Static determination of quantitative resource usage for higher-order programs. SIGPLAN Not.\u00a045, 223\u2013236 (2010)","journal-title":"SIGPLAN Not."},{"issue":"1","key":"4_CR15","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/j.tcs.2011.07.009","volume":"413","author":"E. Albert","year":"2012","unstructured":"Albert, E., Arenas, P., Genaim, S., Puebla, G., Zanardini, D.: Cost analysis of object-oriented bytecode programs. Theoretical Computer Science\u00a0413(1), 142\u2013159 (2012); Quantitative Aspects of Programming Languages (QAPL 2010)","journal-title":"Theoretical Computer Science"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-642-15331-0_3","volume-title":"Foundational and Practical Aspects of Resource Analysis","author":"M. Montenegro","year":"2010","unstructured":"Montenegro, M., Pe\u00f1a, R., Segura, C.: A space consumption analysis by abstract interpretation. In: van Eekelen, M., Shkaravska, O. (eds.) FOPARA 2009. LNCS, vol.\u00a06324, pp. 34\u201350. Springer, Heidelberg (2010)"},{"key":"4_CR17","unstructured":"Lucas, S., Pena, R.: Rewriting techniques for analysing termination and complexity bounds of safe programs. In: Proc. Logic-Based Program Synthesis and Transformation, LOPSTR, vol. 8, pp. 43\u201357 (2008)"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Hoffmann, J., Aehlig, K., Hofmann, M.: Multivariate amortized resource analysis. In: Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011 (2011) (to appear)","DOI":"10.1145\/1926385.1926427"}],"container-title":["Lecture Notes in Computer Science","Trends in Functional Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40447-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T08:21:56Z","timestamp":1557994916000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40447-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642404467","9783642404474"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40447-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}