{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:44:21Z","timestamp":1742402661094},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540603603"},{"type":"electronic","value":"9783540450504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60360-3_47","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:19:37Z","timestamp":1330280377000},"page":"314-329","source":"Crossref","is-referenced-by-count":12,"title":["Trust in the \u03bb-calculus"],"prefix":"10.1007","author":[{"given":"Jens","family":"Palsberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"\u00d8rb\u21d3ek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"J.-P. Ban\u00e2tre, C. Bryce, and D. L. Metayer. Compile-time detection of information flow in sequential programs. In D. Gollmann, editor, Computer Security \u2014 ESORICS 94, 3rd European Symp. on Research in Comp. Security, pages 55\u201373. Springer-Verlag (LNCS 875), 1994.","DOI":"10.1007\/3-540-58618-0_56"},{"key":"20_CR2","unstructured":"H. P. Barendregt. The Lambda Calculus: Its Syntax and Semantics. North-Holland, 1981."},{"key":"20_CR3","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0167-6423(86)90010-9","volume":"7","author":"G. L. Burn","year":"1986","unstructured":"G. L. Burn, C. Hankin, and S. Abramsky. Strictness analysis for higher-order functions. Sci. Comput. Programming, 7:249\u2013278, 1986.","journal-title":"Sci. Comput. Programming"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Fourth ACM Symposium on Principles of Programming Languages, pages 238\u2013252, 1977.","DOI":"10.1145\/512950.512973"},{"issue":"7","key":"20_CR5","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1145\/359636.359712","volume":"20","author":"D. E. Denning","year":"1977","unstructured":"D. E. Denning and P. J. Denning. Certifications of programs for secure information flow. Commun. ACM, 20(7):504\u2013512, July 1977.","journal-title":"Commun. ACM"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"T. Freeman and F. Pfenning. Refinement types for ML. In Proc. ACM SIGPLAN 1991 Conference on Programming Language Design and Implementation, 1991.","DOI":"10.1145\/113445.113468"},{"issue":"1","key":"20_CR7","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1017\/S0956796800000058","volume":"1","author":"C. K. Gomard","year":"1991","unstructured":"C. K. Gomard and N. D. Jones. A partial evaluator for the untyped lambdacalculus. Journal of Functional Programming, 1(1):21\u201369, 1991.","journal-title":"Journal of Functional Programming"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"F. Henglein. Dynamic typing. In Proc. ESOP'92, European Symposium on Programming, pages 233\u2013253. Springer-Verlag (LNCS 582), 1992.","DOI":"10.1007\/3-540-55253-7_14"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"F. Henglein and J. J\u00f8rgensen. Formally optimal boxing. In Proc. POPL'94, 21st Annual Symposium on Principles of Programming Languages, pages 213\u2013226, 1994.","DOI":"10.1145\/174675.177874"},{"issue":"2","key":"20_CR10","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/S0022-0000(05)80051-0","volume":"49","author":"D. Kozen","year":"1994","unstructured":"D. Kozen, J. Palsberg, and M. I. Schwartzbach. Efficient inference of partial types. J. Comput. Syst. Sci., 49(2):306\u2013324, 1994. Also in Proc. FOCS'92, 33rd IEEE Symposium on Foundations of Computer Science, pages 363\u2013371, Pittsburgh, Pennsylvania, October 1992.","journal-title":"J. Comput. Syst. Sci."},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"T.-M. Kuo and P. Mishra. Strictness analysis: A new perspective based on type inference. In Proc. Conference on Functional Programming Languages and Computer Architecture, pages 260\u2013272, 1989.","DOI":"10.1145\/99370.99390"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"J. Mitchell. Coercion and type inference. In Eleventh Symposium on Principles of Programming Languages, pages 175\u2013185, 1984.","DOI":"10.1145\/800017.800529"},{"key":"20_CR13","unstructured":"M. Mizuno and D. Schmidt. A security flow control algorithm and its denotational semantics correctness proof. Technical Report TR-CS-90-21, Kansas State University, 1990."},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"P. \u00d8rb\u00e6k. Can you trust your data? In P. D. Mosses, editor, Proc. TAPSOFT'95, Theory and Practice of Software Development, pages 575\u2013590. Springer-Verlag (LNCS 915), 1995.","DOI":"10.1007\/3-540-59293-8"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"J. Palsberg. Efficient inference of object types. Information and Computation. To appear. Also in Proc. LICS'94, Ninth Annual IEEE Symposium on Logic in Computer Science, pages 186\u2013195, Paris, France, July 1994.","DOI":"10.1109\/LICS.1994.316073"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"J. Palsberg and P. \u00d8rbaek. Trust in the \u03bb-calculus. Technical Report BRICS RS-95-31, BRICS, Computer Science Department, Aarhus University, 1995. URL: http:\/\/www.daimi.aau.dk\/BRICS.","DOI":"10.7146\/brics.v2i31.19934"},{"key":"20_CR17","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0020-0190(92)90196-3","volume":"43","author":"J. Palsberg","year":"1992","unstructured":"J. Palsberg and M. I. Schwartzbach. Safety analysis versus type inference for partial types. Inf. Process. Lett., 43:175\u2013180, 1992.","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"20_CR18","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1006\/inco.1995.1058","volume":"118","author":"J. Palsberg","year":"1995","unstructured":"J. Palsberg and M. I. Schwartzbach. Safety analysis versus type inference. Information and Computation, 118(1):128\u2013141, 1995.","journal-title":"Information and Computation"},{"issue":"3","key":"20_CR19","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1017\/S0956796800000393","volume":"2","author":"J.-P. Talpin","year":"1992","unstructured":"J.-P. Talpin and P. Jouvelot. Polymorphic type, region and effect inference. Journal of Functional Programming, 2(3):245\u2013271, 1992.","journal-title":"Journal of Functional Programming"},{"issue":"1","key":"20_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(91)90050-C","volume":"93","author":"M. Wand","year":"1991","unstructured":"M. Wand. Type inference for record concatenation and multiple inheritance. Information and Computation, 93(1):1\u201315, 1991.","journal-title":"Information and Computation"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"D. A. Wright. A new technique for strictness analysis. In Proc. TAPSOFT'91, pages 235\u2013258. Springer-Verlag (LNCS 494), 1991.","DOI":"10.1007\/3540539816_70"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60360-3_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:58:26Z","timestamp":1605646706000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60360-3_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540603603","9783540450504"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-60360-3_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}