{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T19:48:48Z","timestamp":1725738528256},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642392115"},{"type":"electronic","value":"9783642392122"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39212-2_28","type":"book-chapter","created":{"date-parts":[[2013,7,2]],"date-time":"2013-07-02T13:09:19Z","timestamp":1372770559000},"page":"299-311","source":"Crossref","is-referenced-by-count":4,"title":["Contractive Signatures with Recursive Types, Type Parameters, and Abstract Types"],"prefix":"10.1007","author":[{"given":"Hyeonseung","family":"Im","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keiko","family":"Nakata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sungwoo","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","unstructured":"OCaml, \n                    \n                      http:\/\/caml.inria.fr\/ocaml\/"},{"issue":"4","key":"28_CR2","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/155183.155231","volume":"15","author":"R.M. Amadio","year":"1993","unstructured":"Amadio, R.M., Cardelli, L.: Subtyping recursive types. ACM Transactions on Programming Languages and Systems\u00a015(4), 575\u2013631 (1993)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/3-540-62688-3_29","volume-title":"Typed Lambda Calculi and Applications","author":"M. Brandt","year":"1997","unstructured":"Brandt, M., Henglein, F.: Coinductive axiomatization of recursive type equality and subtyping. In: de Groote, P., Hindley, J.R. (eds.) TLCA 1997. LNCS, vol.\u00a01210, pp. 63\u201381. Springer, Heidelberg (1997)"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Crary, K., Harper, R., Puri, S.: What is a recursive module? In: PLDI 1999 (1999)","DOI":"10.1145\/301618.301641"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-642-13321-3_8","volume-title":"Mathematics of Program Construction","author":"N.A. Danielsson","year":"2010","unstructured":"Danielsson, N.A., Altenkirch, T.: Subtyping, declaratively: an exercise in mixed induction and coinduction. In: Bolduc, C., Desharnais, J., Ktari, B. (eds.) MPC 2010. LNCS, vol.\u00a06120, pp. 100\u2013118. Springer, Heidelberg (2010)"},{"issue":"6","key":"28_CR6","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1017\/S0956796802004318","volume":"12","author":"V. Gapeyev","year":"2002","unstructured":"Gapeyev, V., Levin, M.Y., Pierce, B.C.: Recursive subtyping revealed. Journal of Functional Programming\u00a012(6), 511\u2013548 (2002)","journal-title":"Journal of Functional Programming"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Im, H., Nakata, K., Garrigue, J., Park, S.: A syntactic type system for recursive modules. In: OOPSLA 2011 (2011)","DOI":"10.1145\/2048066.2048141"},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-642-32037-8_2","volume-title":"Trends in Functional Programming","author":"V. Komendantsky","year":"2012","unstructured":"Komendantsky, V.: Subtyping by folding an inductive relation into a coinductive one. In: Pe\u00f1a, R., Page, R. (eds.) TFP 2011. LNCS, vol.\u00a07193, pp. 17\u201332. Springer, Heidelberg (2012)"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"MacQueen, D., Plotkin, G., Sethi, R.: An ideal model for recursive polymorphic types. In: POPL 1984 (1984)","DOI":"10.1145\/800017.800528"},{"issue":"1-2","key":"28_CR10","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0168-0072(91)90069-X","volume":"51","author":"N.P. Mendler","year":"1991","unstructured":"Mendler, N.P.: Inductive types and type constraints in the second-order lambda calculus. Annals of Pure and Applied Logic\u00a051(1-2), 159\u2013172 (1991)","journal-title":"Annals of Pure and Applied Logic"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Milner, R., Tofte, M., Harper, R., MacQueen, D.: The Definition of Standard ML (Revised). The MIT Press (1997)","DOI":"10.7551\/mitpress\/2319.001.0001"},{"key":"28_CR12","unstructured":"Montagu, B.: Programming with first-class modules in a core language with subtyping, singleton kinds and open existential types. PhD thesis, \u00c9cole Polytechnique, Palaiseau, France (December 2010)"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Montagu, B., R\u00e9my, D.: Modeling abstract types in modules with open existential types. In: POPL 2009 (2009)","DOI":"10.1145\/1594834.1480926"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Nakata, K., Uustalu, T.: Resumptions, weak bisimilarity and big-step semantics for While with interactive I\/O: An exercise in mixed induction-coinduction. In: SOS 2010, pp. 57\u201375 (2010)","DOI":"10.4204\/EPTCS.32.5"},{"issue":"1","key":"28_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2450136.2450137","volume":"35","author":"A. Rossberg","year":"2013","unstructured":"Rossberg, A., Dreyer, D.: Mixin\u2019 up the ML module system. ACM Transactions on Programming Languages and Systems\u00a035(1), 2:1\u20132:84 (2013)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"28_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1007\/3-540-63165-8_221","volume-title":"Automata, Languages and Programming","author":"G. S\u00e9nizergues","year":"1997","unstructured":"S\u00e9nizergues, G.: The equivalence problem for deterministic pushdown automata is decidable. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol.\u00a01256, pp. 671\u2013681. Springer, Heidelberg (1997)"},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"Solomon, M.: Type definitions with parameters (extended abstract). In: POPL 1978 (1978)","DOI":"10.1145\/512760.512765"},{"key":"28_CR18","unstructured":"Stone, C.A., Schoonmaker, A.P.: Equational theories with recursive types (2005), \n                    \n                      http:\/\/www.cs.hmc.edu\/~stone\/publications.html"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39212-2_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T09:27:49Z","timestamp":1557912469000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39212-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392115","9783642392122"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39212-2_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}