{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T11:15:36Z","timestamp":1770290136019,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540565178","type":"print"},{"value":"9783540475866","type":"electronic"}],"license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/bfb0037104","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T15:21:36Z","timestamp":1138202496000},"page":"146-162","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Recursive types are not conservative over F\u2264"],"prefix":"10.1007","author":[{"given":"Giorgio","family":"Ghelli","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,28]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"R. Amadio, L. Cardelli, Subtyping Recursive Types, DEC SRC Research Report 62, short version in Proc. of the 18th ACM Symposium on Principles of Programming Languages, 104\u2013118, 1991.","DOI":"10.1145\/99583.99600"},{"issue":"1\/2","key":"11_CR2","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/0890-5401(90)90062-M","volume":"87","author":"K. Bruce","year":"1990","unstructured":"K. Bruce, G. Longo, A Modest Model of Records, Inheritance and Bounded Quantification, Information and Computation 87 (1\/2), 196\u2013240, 1990.","journal-title":"Information and Computation"},{"key":"11_CR3","unstructured":"L. Cardelli, Fsub: the System, note, 1991."},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"L. Cardelli, G. Longo, A Semantic Basis for Quest, DEC SRC Research Report 55, short version in Proc. Conf. on Lisp and Functional Programming, Nice, 1990.","DOI":"10.1145\/91556.91586"},{"key":"11_CR5","volume-title":"LNCS 526","author":"L. Cardelli","year":"1991","unstructured":"L. Cardelli, S. Martini, J. Mitchell, A. Scedrov, An Extension of System F with Subtyping, Proc. Conference on Theoretical Aspects of Computer Software, Sendai, Japan, Springer-Verlag, Berlin, LNCS 526,1991."},{"issue":"4","key":"11_CR6","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1145\/6041.6042","volume":"17","author":"L. Cardelli","year":"1985","unstructured":"L. Cardelli, P. Wegner, On Understanding Types, Data Abstraction and Polymorphism, ACM Computing Surveys 17(4), 471\u2013522,1985.","journal-title":"ACM Computing Surveys"},{"issue":"1","key":"11_CR7","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1017\/S0960129500001134","volume":"2","author":"P.-L. Curien","year":"1992","unstructured":"P.-L. Curien, G. Ghelli, Coherence of Subsumption in F\u2264, Minimum Typing and Type Checking, Mathematical Structures in Computer Science 2(1), 55\u201391, 1992.","journal-title":"Mathematical Structures in Computer Science"},{"key":"11_CR8","first-page":"731","volume-title":"LNCS 526","author":"P.-L. Curien","year":"1991","unstructured":"P.-L. Curien, G. Ghelli, Subtyping + Extensionality: Confluence of \u00df\u03b7top\u2264 in F\u2264, extended abstract, Proc. Conference on Theoretical Aspects of Computer Software, Sendai, Japan, Springer-Verlag, Berlin, LNCS 526, 731\u2013749,1991."},{"key":"11_CR9","unstructured":"G. Ghelli, Divergence of F\u2264Type-checking, note, 1991."},{"key":"11_CR10","unstructured":"G. Ghelli, B. Pierce, Bounded Existentials and Minimal Typing, note, 1992."},{"key":"11_CR11","unstructured":"G. Ghelli, Proof-theoretic Studies about a Minimal Type System Integrating Inclusion and Parametric Polymorphism, PhD Thesis, TD-6\/90, Univ. of Pisa, 1990."},{"key":"11_CR12","unstructured":"D. Katiyar, S. Sankar, Completely bounded quantification is decidable, Proc. of the ACM SIGPLAN Workshop on ML and its Applications, 1992."},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"B. Pierce, Bounded Quantification is Undecidable, Proc. of the 19th ACM Symposium on Principles of Programming Languages, 305\u2013315, 1992.","DOI":"10.1145\/143165.143228"}],"container-title":["Lecture Notes in Computer Science","Typed Lambda Calculi and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0037104","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T19:44:12Z","timestamp":1578512652000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0037104"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540565178","9783540475866"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0037104","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]},"assertion":[{"value":"28 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}