{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:07Z","timestamp":1772164027130,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,1,23]],"date-time":"2013-01-23T00:00:00Z","timestamp":1358899200000},"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":[[2013,1,23]]},"DOI":"10.1145\/2429069.2429090","type":"proceedings-article","created":{"date-parts":[[2013,1,22]],"date-time":"2013-01-22T10:29:29Z","timestamp":1358850569000},"page":"167-178","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":29,"title":["The geometry of types"],"prefix":"10.1145","author":[{"given":"Ugo","family":"Dal lago","sequence":"first","affiliation":[{"name":"Universit\u00e0 di Bologna & INRIA, Bologna, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barbara","family":"Petit","sequence":"additional","affiliation":[{"name":"Universit\u00e0 di Bologna & INRIA, Bologna, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,1,23]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2000.2930"},{"key":"e_1_3_2_2_2_1","volume-title":"Regis-Gianas","author":"Amadio R.M.","year":"2011","unstructured":"Amadio , R.M. , Regis-Gianas , Y. : Certifying and reasoning on cost annotations of functional programs. CoRR abs\/1110.2350 ( 2011 ) Amadio, R.M., Regis-Gianas, Y.: Certifying and reasoning on cost annotations of functional programs. CoRR abs\/1110.2350 (2011)"},{"key":"e_1_3_2_2_3_1","volume-title":": Mathematical Theory of Program Correctness","author":"de Bakker J.W.","year":"1980","unstructured":"de Bakker , J.W. : Mathematical Theory of Program Correctness . Prentice-Hall ( 1980 ) de Bakker, J.W.: Mathematical Theory of Program Correctness. Prentice-Hall (1980)"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87531-4_35"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2003.10.022"},{"key":"e_1_3_2_2_6_1","first-page":"53","volume-title":"Paskevich","author":"Bobot F.","year":"2011","unstructured":"Bobot , F. , Filliatre , J.C. , March\u00e9 , C. , Paskevich , A. : Why3: Shepherd your herd of provers. In : First InternationalWorkshop on Intermediate Verification Languages . pp. 53 -- 64 ( 2011 ) Bobot, F., Filliatre, J.C., March\u00e9, C., Paskevich, A.: Why3: Shepherd your herd of provers. In: First InternationalWorkshop on Intermediate Verification Languages. pp. 53--64 (2011)"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/322108.322121"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1759148.1759156"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/0207005"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2006.21"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2011.22"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2429069.2429090"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2370776.2370792"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00049-3"},{"key":"e_1_3_2_2_15_1","first-page":"148","volume-title":"Refinement types for specification","author":"Denney E.","year":"1998","unstructured":"Denney , E. : Refinement types for specification . In : IFIP-PROCOMET. pp. 148 -- 166 ( 1998 ) Denney, E.: Refinement types for specification. In: IFIP-PROCOMET. pp. 148--166 (1998)"},{"key":"e_1_3_2_2_16_1","volume-title":"Friedman","author":"Felleisen M.","year":"1986","unstructured":"Felleisen , M. , Friedman , D.P. : Control operators, the SECD-machine and the _-calculus. Tech. Rep. 197, Computer Science Department, Indiana University ( 1986 ) Felleisen, M., Friedman, D.P.: Control operators, the SECD-machine and the _-calculus. Tech. Rep. 197, Computer Science Department, Indiana University (1986)"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1040305.1040313"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926425"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90386-T"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02658-4_7"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926427"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/237721.240882"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1706299.1706327"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10990-007-9018-9"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)00022-2"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(77)90044-5"},{"key":"e_1_3_2_2_27_1","first-page":"361","volume-title":"ESOP 1990","volume":"432","author":"Sands D.","year":"1990","unstructured":"Sands , D. : Complexity analysis for a lazy higher-order language . In: ESOP 1990 . LNCS, vol. 432 , pp. 361 -- 376 ( 1990 ) Sands, D.: Complexity analysis for a lazy higher-order language. In: ESOP 1990. LNCS, vol. 432, pp. 361--376 (1990)"},{"key":"e_1_3_2_2_28_1","first-page":"298","volume-title":"Functional Programming.","author":"Sands D.","year":"1991","unstructured":"Sands , D. : Operational theories of improvement in functional languages (extended abstract) . In: Functional Programming. pp. 298 -- 311 ( 1991 ) Sands, D.: Operational theories of improvement in functional languages (extended abstract). In: Functional Programming. pp. 298--311 (1991)"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1347375.1347389"}],"event":{"name":"POPL '13: The 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"Rome Italy","acronym":"POPL '13","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2429069.2429090","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2429069.2429090","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:35:35Z","timestamp":1750221335000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2429069.2429090"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,23]]},"references-count":29,"alternative-id":["10.1145\/2429069.2429090","10.1145\/2429069"],"URL":"https:\/\/doi.org\/10.1145\/2429069.2429090","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2480359.2429090","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2013,1,23]]},"assertion":[{"value":"2013-01-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}