{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T00:47:43Z","timestamp":1775868463783,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642452208","type":"print"},{"value":"9783642452215","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45221-5_47","type":"book-chapter","created":{"date-parts":[[2013,12,5]],"date-time":"2013-12-05T09:28:23Z","timestamp":1386235703000},"page":"710-726","source":"Crossref","is-referenced-by-count":5,"title":["Tracking Data-Flow with Open Closure Types"],"prefix":"10.1007","author":[{"given":"Gabriel","family":"Scherer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Hoffmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"47_CR1","doi-asserted-by":"crossref","unstructured":"Abel, A.: Semi-continuous Sized Types and Termination. Log. Methods Comput. Sci.\u00a04(2) (2008)","DOI":"10.2168\/LMCS-4(2:3)2008"},{"key":"47_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/978-3-540-87531-4_35","volume-title":"Computer Science Logic","author":"G. Barthe","year":"2008","unstructured":"Barthe, G., Gr\u00e9goire, B., Riba, C.: Type-Based Termination with Sized Products. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol.\u00a05213, pp. 493\u2013507. Springer, Heidelberg (2008)"},{"issue":"2-3","key":"47_CR3","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. High.-Ord. and Symb. Comp.\u00a014(2-3), 261\u2013300 (2001)","journal-title":"High.-Ord. and Symb. Comp."},{"key":"47_CR4","unstructured":"Hannan, J., Hicks, P., Liben-Nowell, D.: A Lifetime Analysis for Higher-Order Languages. Tech. rep., The Pennsylvania State University (1997), \n                  \n                    http:\/\/www.cse.psu.edu\/~hannan\/papers\/live.ps.gz"},{"key":"47_CR5","doi-asserted-by":"crossref","unstructured":"Heintze, N., Riecke, J.G.: The SLam Calculus: Programming with Secrecy and Integrity. In: 25th Symp. on Principles of Programming Languages (POPL 1998), pp. 365\u2013377 (1998)","DOI":"10.1145\/268946.268976"},{"key":"47_CR6","doi-asserted-by":"crossref","unstructured":"Hoffmann, J., Aehlig, K., Hofmann, M.: Multivariate Amortized Resource Analysis. ACM Trans. Program. Lang. Syst. (2012)","DOI":"10.1145\/2362389.2362393"},{"key":"47_CR7","doi-asserted-by":"crossref","unstructured":"Jost, S., Hammond, K., Loidl, H.W., Hofmann, M.: Static Determination of Quantitative Resource Usage for Higher-Order Programs. In: 37th Symp. on Principles of Programming Languages (POPL 2010), pp. 223\u2013236 (2010)","DOI":"10.1145\/1706299.1706327"},{"key":"47_CR8","doi-asserted-by":"crossref","unstructured":"Lago, U.D., Petit, B.: The Geometry of Types. In: 40th Symp. on Principles of Programming Languages (POPL 2013), pp. 167\u2013178 (2013)","DOI":"10.1145\/2480359.2429090"},{"key":"47_CR9","unstructured":"Leroy, X.: Polymorphic Typing of an Algorithmic Language. Research report 1778, INRIA (1992)"},{"key":"47_CR10","doi-asserted-by":"crossref","unstructured":"Minamide, Y., Morrisett, J.G., Harper, R.: Typed Closure Conversion. In: 23rd Symp. on Principles of Programming Languages (POPL 1996), pp. 271\u2013283 (1996)","DOI":"10.1145\/237721.237791"},{"key":"47_CR11","doi-asserted-by":"crossref","unstructured":"Moggi, E., Taha, W., Benaissa, Z.E.-A., Sheard, T.: An idealized metaml: Simpler, and more expressive. In: 8th Europ. Symp. on Programming (ESOP 1999), pp. 193\u2013207 (1999)","DOI":"10.1007\/3-540-49099-X_13"},{"key":"47_CR12","doi-asserted-by":"crossref","unstructured":"Nanevski, A., Pfenning, F., Pientka, B.: Contextual Modal Type Theory. ACM Trans. Comput. Log.\u00a09(3) (2008)","DOI":"10.1145\/1352582.1352591"},{"key":"47_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-642-39212-2_35","volume-title":"Automata, Languages, and Programming","author":"T. Petricek","year":"2013","unstructured":"Petricek, T., Orchard, D., Mycroft, A.: Coeffects: Unified static analysis of context-dependence. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol.\u00a07966, pp. 385\u2013397. Springer, Heidelberg (2013)"},{"key":"47_CR14","doi-asserted-by":"crossref","unstructured":"Pientka, B., Dunfield, J.: Programming with Proofs and Explicit Contexts. In: 10th International Conference on Principles and Practice of Declarative Programming (PPDP 2008), pp. 163\u2013173 (2008)","DOI":"10.1145\/1389449.1389469"},{"issue":"1","key":"47_CR15","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/JSAC.2002.806121","volume":"21","author":"A. Sabelfeld","year":"2003","unstructured":"Sabelfeld, A., Myers, A.C.: Language-based information-flow security. IEEE Journal on Selected Areas in Communications\u00a021(1), 5\u201319 (2003)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"47_CR16","doi-asserted-by":"crossref","unstructured":"Stampoulis, A., Shao, Z.: Static and User-Extensible Proof Checking. In: 39th Symp. on Principles of Programming Languages (POPL 2012), pp. 273\u2013284 (2012)","DOI":"10.1145\/2103656.2103690"},{"key":"47_CR17","doi-asserted-by":"crossref","unstructured":"Tsukada, T., Igarashi, A.: A Logical Foundation for Environment Classifiers. Logical Methods in Computer Science\u00a06(4) (2010)","DOI":"10.2168\/LMCS-6(4:8)2010"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45221-5_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T04:28:54Z","timestamp":1558758534000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45221-5_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642452208","9783642452215"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45221-5_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}