{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:12:49Z","timestamp":1725585169821},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642216909"},{"type":"electronic","value":"9783642216916"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21691-6_17","type":"book-chapter","created":{"date-parts":[[2011,6,11]],"date-time":"2011-06-11T01:31:26Z","timestamp":1307755886000},"page":"198-212","source":"Crossref","is-referenced-by-count":2,"title":["Partiality, State and Dependent Types"],"prefix":"10.1007","author":[{"given":"Kasper","family":"Svendsen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lars","family":"Birkedal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aleksandar","family":"Nanevski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"The Coq Proof Assistant, http:\/\/coq.inria.fr\/"},{"key":"17_CR2","unstructured":"Coq Reference Manual, Version 8.3"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-540-27836-8_8","volume-title":"Automata, Languages and Programming","author":"M. Abbott","year":"2004","unstructured":"Abbott, M., Altenkirch, T., Ghani, N.: Representing nested inductive types using W-types. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 59\u201371. Springer, Heidelberg (2004)"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0890-5401(91)90074-C","volume":"91","author":"R.M. Amadio","year":"1991","unstructured":"Amadio, R.M.: Recursion over Realizability Structures. Information and Computation\u00a091, 55\u201385 (1991)","journal-title":"Information and Computation"},{"issue":"4","key":"17_CR5","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1017\/S0960129510000162","volume":"20","author":"L. Birkedal","year":"2010","unstructured":"Birkedal, L., St\u00f8vring, K., Thamsborg, J.: Realisability semantics of parametric polymorphism, general references and recursive types. Math. Struct. Comp. Sci.\u00a020(4), 655\u2013703 (2010)","journal-title":"Math. Struct. Comp. Sci."},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"The Vienna Development Method: The Meta-Language","year":"1978","unstructured":"Bjorner, D., Jones, C.B. (eds.): The Vienna Development Method: The Meta-Language. LNCS, vol.\u00a061. Springer, Heidelberg (1978)"},{"key":"17_CR7","unstructured":"Bove, A.: Simple General Recursion in Type Theory. Nordic Journal of Computing\u00a08 (2000)"},{"issue":"2","key":"17_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-1(2:1)2005","volume":"1","author":"V. Capretta","year":"2005","unstructured":"Capretta, V.: General Recursion via Coinductive Types. Logical Methods in Computer Science\u00a01(2), 1\u201328 (2005)","journal-title":"Logical Methods in Computer Science"},{"key":"17_CR9","unstructured":"Constable, R.L., Smith, S.F.: Partial Objects in Constructive Type Theory. In: Proceedings of Second IEEE Symposium on Logic in Computer Science (1987)"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Crary, K.: Admissibility of Fixpoint Induction over Partial Types. In: Automated Deduction - CADE-15 (1998)","DOI":"10.1007\/BFb0054265"},{"issue":"1-2","key":"17_CR11","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/S0304-3975(96)00145-4","volume":"176","author":"P. Dybjer","year":"1997","unstructured":"Dybjer, P.: Representing inductively defined sets by wellorderings in Martin-L\u00f6f\u2019s type theory. Theor. Comput. Sci.\u00a0176(1-2), 329\u2013335 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR12","unstructured":"Gonthier, G., Mahboubi, A.: A Small Scale Reflection Extension for the Coq system. Technical report, INRIA (2007)"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/BF00289507","volume":"1","author":"C.A.R. Hoare","year":"1972","unstructured":"Hoare, C.A.R.: Proof of correctness of data representations. Acta Informatica\u00a01, 271\u2013281 (1972)","journal-title":"Acta Informatica"},{"key":"17_CR14","volume-title":"Categorical Logic and Type Theory","author":"B. Jacobs","year":"1999","unstructured":"Jacobs, B.: Categorical Logic and Type Theory. Elsevier Science, Amsterdam (1999)"},{"key":"17_CR15","volume-title":"Object-oriented software construction","author":"B. Meyer","year":"1997","unstructured":"Meyer, B.: Object-oriented software construction. Prentice Hall, Englewood Cliffs (1997)"},{"issue":"1-3","key":"17_CR16","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0168-0072(00)00012-9","volume":"104","author":"I. Moerdijk","year":"2000","unstructured":"Moerdijk, I., Palmgren, E.: Wellfounded trees in categories. Annals of Pure and Applied Logic\u00a0104(1-3), 189\u2013218 (2000)","journal-title":"Annals of Pure and Applied Logic"},{"issue":"5-6","key":"17_CR17","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1017\/S0956796808006953","volume":"18","author":"A. Nanevski","year":"2008","unstructured":"Nanevski, A., Morrisett, G., Birkedal, L.: Hoare Type Theory, Polymorphism and Separation. Journal of Functional Programming\u00a018(5-6), 865\u2013911 (2008)","journal-title":"Journal of Functional Programming"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Nanevski, A., Morrisett, G., Shinnar, A., Govereau, P., Birkedal, L.: Ynot: Dependent Types for Imperative Programs. In: Proceedings of ICFP 2008, pp. 229\u2013240 (2008)","DOI":"10.1145\/1411204.1411237"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Nanevski, A., Vafeiadis, V., Berdine, J.: Structuring the Verification of Heap-Manipulating Programs. In: Proceedings of POPL 2010 (2010)","DOI":"10.1145\/1706299.1706331"},{"key":"17_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44802-0_1","volume-title":"Computer Science Logic","author":"P. O\u2019Hearn","year":"2001","unstructured":"O\u2019Hearn, P., Reynolds, J., Yang, H.: Local reasoning about programs that alter data structures. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol.\u00a02142, pp. 1\u201319. Springer, Heidelberg (2001)"},{"key":"17_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78739-6_26","volume-title":"Programming Languages and Systems","author":"R.L. Petersen","year":"2008","unstructured":"Petersen, R.L., Birkedal, L., Nanevski, A., Morrisett, G.: A realizability model for impredicative hoare type theory. In: Gairing, M. (ed.) ESOP 2008. LNCS, vol.\u00a04960, pp. 337\u2013352. Springer, Heidelberg (2008)"},{"key":"17_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0105416","volume-title":"Theorem Proving in Higher Order Logics","author":"B. Reus","year":"1996","unstructured":"Reus, B.: Synthetic Domain Theory in Type Theory: Another Logic of Computable Functions. In: von Wright, J., Harrison, J., Grundy, J. (eds.) TPHOLs 1996. LNCS, vol.\u00a01125. Springer, Heidelberg (1996)"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Svendsen, K., Birkedal, L., Nanevski, A.: Partiality, State and Dependent Types. Technical report, IT University of Copenhagen (2011), http:\/\/www.itu.dk\/people\/kasv\/ihtt-adm-tr.pdf","DOI":"10.1007\/978-3-642-21691-6_17"}],"container-title":["Lecture Notes in Computer Science","Typed Lambda Calculi and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21691-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T12:57:29Z","timestamp":1560257849000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21691-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642216909","9783642216916"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21691-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}