{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T03:12:30Z","timestamp":1775790750941,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642171635","type":"print"},{"value":"9783642171642","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17164-2_25","type":"book-chapter","created":{"date-parts":[[2010,11,19]],"date-time":"2010-11-19T10:54:39Z","timestamp":1290164079000},"page":"360-375","source":"Crossref","is-referenced-by-count":9,"title":["A Certified Implementation of ML with Structural Polymorphism"],"prefix":"10.1007","author":[{"given":"Jacques","family":"Garrigue","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Aydemir, B., Chargu\u00e9raud, A., Pierce, B.C., Pollack, R., Weirich, S.: Engineering formal metatheory. In: Proc. ACM Symposium on Principles of Programming Languages, pp. 3\u201315 (2008)","DOI":"10.1145\/1328897.1328443"},{"key":"25_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/11541868_4","volume-title":"Theorem Proving in Higher Order Logics","author":"B.E. Aydemir","year":"2005","unstructured":"Aydemir, B.E., Bohannon, A., Fairbairn, M., Foster, J.N., Pierce, B.C., Sewell, P., Vytiniotis, D., Washburn, G., Weirich, S., Zdancewic, S.: Mechanized metatheory for the masses: The PoplMark challenge. In: Hurd, J., Melham, T. (eds.) TPHOLs 2005. LNCS, vol.\u00a03603, pp. 50\u201365. Springer, Heidelberg (2005)"},{"key":"25_CR3","unstructured":"Barras, B.: Auto-validation d\u2019un syst\u00e8me de preuves avec familles inductives. Th\u00e8se de doctorat, Universit\u00e9 Paris\u00a07 (November 1999)"},{"key":"25_CR4","unstructured":"Crary, K., Harper, B.: Mechanized definition of Standard ML alpha release. Twelf proof scripts (August 2009)"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/3-540-44659-1_9","volume-title":"Theorem Proving in Higher Order Logics","author":"C. Dubois","year":"2000","unstructured":"Dubois, C.: Proving ML type soundness within Coq. In: Aagaard, M.D., Harrison, J. (eds.) TPHOLs 2000. LNCS, vol.\u00a01869, pp. 126\u2013144. Springer, Heidelberg (2000)"},{"issue":"3","key":"25_CR6","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1023\/A:1006285817788","volume":"23","author":"C. Dubois","year":"1999","unstructured":"Dubois, C., M\u00e9nissier-Morain, V.: Certification of a type inference tool for ML: Damas-Milner within Coq. Journal of Automated Reasoning\u00a023(3), 319\u2013346 (1999)","journal-title":"Journal of Automated Reasoning"},{"key":"25_CR7","unstructured":"Furuse, J.P., Garrigue, J.: A label-selective lambda-calculus with optional arguments and its compilation method. RIMS Preprint 1041, Research Institute for Mathematical Sciences, Kyoto University (October 1995)"},{"key":"25_CR8","unstructured":"Garrigue, J.: Simple type inference for structural polymorphism. In: The Ninth International Workshop on Foundations of Object-Oriented Languages, Portland, Oregon (2002)"},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24754-8_15","volume-title":"Functional and Logic Programming","author":"J. Garrigue","year":"2004","unstructured":"Garrigue, J.: Relaxing the value restriction. In: Kameyama, Y., Stuckey, P.J. (eds.) FLOPS 2004. LNCS, vol.\u00a02998, Springer, Heidelberg (2004)"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1006\/inco.1999.2830","volume":"155","author":"J. Garrigue","year":"1999","unstructured":"Garrigue, J., R\u00e9my, D.: Extending ML with semi-explicit higher order polymorphism. Information and Computation\u00a0155, 134\u2013171 (1999)","journal-title":"Information and Computation"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Lee, D.K., Crary, K., Harper, R.: Towards a mechanized metatheory of standard ML. In: Proc. ACM Symposium on Principles of Programming Languages, pp. 173\u2013184 (January 2007)","DOI":"10.1145\/1190216.1190245"},{"key":"25_CR12","unstructured":"Leroy, X., Doligez, D., Garrigue, J., R\u00e9my, D., Vouillon, J.: The Objective Caml system release 3.11, Documentation and user\u2019s manual. Projet Gallium, INRIA (November 2008)"},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1023\/A:1006277616879","volume":"23","author":"W. Naraschewski","year":"1999","unstructured":"Naraschewski, W., Nipkow, T.: Type inference verified: Algorithm W in Isabelle\/HOL. Journal of Automated Reasoning\u00a023, 299\u2013318 (1999)","journal-title":"Journal of Automated Reasoning"},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-48737-9_4","volume-title":"Formal Syntax and Semantics of Java","author":"D.v. Oheimb","year":"1999","unstructured":"Oheimb, D.v., Nipkow, T.: Machine-checking the Java specification: Proving type-safety. In: Alves-Foss, J. (ed.) Formal Syntax and Semantics of Java. LNCS, vol.\u00a01523, pp. 119\u2013156. Springer, Heidelberg (1999)"},{"key":"25_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-78739-6_1","volume-title":"Programming Languages and Systems","author":"S. Owens","year":"2008","unstructured":"Owens, S.: A sound semantics for OCaml light. In: Drossopoulou, S. (ed.) ESOP 2008. LNCS, vol.\u00a04960, pp. 1\u201315. Springer, Heidelberg (2008)"},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0167-6423(85)90009-7","volume":"5","author":"L. Paulson","year":"1985","unstructured":"Paulson, L.: Verifying the unification algorithm in LCF. Science of Computer Programming\u00a05, 143\u2013169 (1985)","journal-title":"Science of Computer Programming"},{"key":"25_CR17","unstructured":"The Coq Team. The Coq Proof Assistant, Version 8.2. INRIA (2009)"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Tobin-Hochstadt, S., Felleisen, M.: The design and implementation of typed scheme. In: Proc. ACM Symposium on Principles of Programming Languages (2008)","DOI":"10.1145\/1328438.1328486"},{"key":"25_CR19","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1017\/CBO9780511770524.017","volume-title":"From Semantics to Computer Science. Essays in Honour of Gilles Kahn","author":"C. Urban","year":"2009","unstructured":"Urban, C., Nipkow, T.: Nominal verification of algorithm W. In: Huet, G., L\u00e9vy, J.-J., Plotkin, G. (eds.) From Semantics to Computer Science. Essays in Honour of Gilles Kahn, pp. 363\u2013382. Cambridge University Press, Cambridge (2009)"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17164-2_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T11:18:21Z","timestamp":1559819901000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17164-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642171635","9783642171642"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17164-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}