{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T19:44:29Z","timestamp":1794339869761,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540341666","type":"print"},{"value":"9783540341680","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11753728_39","type":"book-chapter","created":{"date-parts":[[2006,4,27]],"date-time":"2006-04-27T16:17:13Z","timestamp":1146154633000},"page":"381-392","source":"Crossref","is-referenced-by-count":8,"title":["Polarized Subtyping for Sized Types"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Abel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"39_CR1","unstructured":"Abel, A.: Weak normalization for the simply-typed lambda-calculus in Twelf. In: Logical Frameworks and Metalanguages (LFM 2004). IJCAR, Cork, Ireland (2004)"},{"key":"39_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-540-30124-0_17","volume-title":"Computer Science Logic","author":"A. Abel","year":"2004","unstructured":"Abel, A., Matthes, R.: Fixed points of type constructors and primitive recursion. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL 2004. LNCS, vol.\u00a03210, pp. 190\u2013204. Springer, Heidelberg (2004)"},{"issue":"1\u20132","key":"39_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2004.10.017","volume":"333","author":"A. Abel","year":"2005","unstructured":"Abel, A., Matthes, R., Uustalu, T.: Iteration schemes for higher-order and nested datatypes. Theoretical Computer Science\u00a0333(1\u20132), 3\u201366 (2005)","journal-title":"Theoretical Computer Science"},{"key":"39_CR4","doi-asserted-by":"crossref","unstructured":"Adams, R.: A Modular Hierarchy of Logical Frameworks. Ph.D. thesis, University of Manchester (2005)","DOI":"10.1007\/978-3-540-24849-1_1"},{"key":"39_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/3-540-48168-0_32","volume-title":"Computer Science Logic","author":"T. Altenkirch","year":"1999","unstructured":"Altenkirch, T., Reus, B.: Monadic presentations of lambda terms using generalized inductive types. In: Flum, J., Rodr\u00edguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol.\u00a01683, pp. 453\u2013468. Springer, Heidelberg (1999)"},{"issue":"1","key":"39_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0960129503004122","volume":"14","author":"G. Barthe","year":"2004","unstructured":"Barthe, G., Frade, M.J., Gim\u00e9nez, E., Pinto, L., Uustalu, T.: Type-based termination of recursive definitions. Mathematical Structures in Computer Science\u00a014(1), 1\u201345 (2004)","journal-title":"Mathematical Structures in Computer Science"},{"issue":"1","key":"39_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1017\/S0956796899003366","volume":"9","author":"R.S. Bird","year":"1999","unstructured":"Bird, R.S., Paterson, R.: De Bruijn notation as a nested datatype. J. of Funct. Program.\u00a09(1), 77\u201391 (1999)","journal-title":"J. of Funct. Program."},{"key":"39_CR8","doi-asserted-by":"crossref","unstructured":"Compagnoni, A., Goguen, H.: Anti-symmetry of higher-order subtyping and equality by subtyping (submitted, 2005)","DOI":"10.1017\/S0960129505005086"},{"key":"39_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/3-540-48168-0_30","volume-title":"Computer Science Logic","author":"A.B. Compagnoni","year":"1999","unstructured":"Compagnoni, A.B., Goguen, H.: Anti-symmetry of higher-order subtyping. In: Flum, J., Rodr\u00edguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol.\u00a01683, pp. 420\u2013438. Springer, Heidelberg (1999)"},{"issue":"2","key":"39_CR10","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1016\/S0890-5401(03)00062-2","volume":"184","author":"A.B. Compagnoni","year":"2003","unstructured":"Compagnoni, A.B., Goguen, H.: Typed operational semantics for higher-order subtyping. Inf. Comput.\u00a0184(2), 242\u2013297 (2003)","journal-title":"Inf. Comput."},{"key":"39_CR11","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1017\/CBO9780511569807.011","volume-title":"Logical Frameworks","author":"T. Coquand","year":"1991","unstructured":"Coquand, T.: An algorithm for testing conversion in type theory. In: Huet, G., Plotkin, G. (eds.) Logical Frameworks, pp. 255\u2013279. Cambridge University Press, Cambridge (1991)"},{"key":"39_CR12","unstructured":"Duggan, D., Compagnoni, A.: Subtyping for object type constructors (1998), Presented at FOOL 6"},{"key":"39_CR13","series-title":"Cambridge Tracts in Theoretical Computer Science","volume-title":"Proofs and Types","author":"J.-Y. Girard","year":"1989","unstructured":"Girard, J.-Y., Lafont, Y., Taylor, P.: Proofs and Types. Cambridge Tracts in Theoretical Computer Science, vol.\u00a07. Cambridge University Press, Cambridge (1989)"},{"key":"39_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/BFb0014053","volume-title":"Typed Lambda Calculi and Applications","author":"H. Goguen","year":"1995","unstructured":"Goguen, H.: Typed operational semantics. In: Dezani-Ciancaglini, M., Plotkin, G. (eds.) TLCA 1995. LNCS, vol.\u00a0902, pp. 186\u2013200. Springer, Heidelberg (1995)"},{"key":"39_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/3-540-48959-2_14","volume-title":"Typed Lambda Calculi and Applications","author":"H. Goguen","year":"1999","unstructured":"Goguen, H.: Soundness of the logical framework for its typed operational semantics. In: Girard, J.-Y. (ed.) TLCA 1999. LNCS, vol.\u00a01581, pp. 177\u2013197. Springer, Heidelberg (1999)"},{"key":"39_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-540-31982-5_26","volume-title":"Foundations of Software Science and Computational Structures","author":"H. Goguen","year":"2005","unstructured":"Goguen, H.: Justifying algorithms for \u03b2\u03b7 conversion. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol.\u00a03441, pp. 410\u2013424. Springer, Heidelberg (2005)"},{"issue":"1","key":"39_CR17","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/1042038.1042041","volume":"6","author":"R. Harper","year":"2005","unstructured":"Harper, R., Pfenning, F.: On equivalence and canonical forms in the LF type theory. ACM Transactions on Computational Logic\u00a06(1), 61\u2013101 (2005)","journal-title":"ACM Transactions on Computational Logic"},{"issue":"4","key":"39_CR18","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1017\/S0956796800003713","volume":"10","author":"R. Hinze","year":"2000","unstructured":"Hinze, R.: Generalizing generalized tries. J. of Funct. Program.\u00a010(4), 327\u2013351 (2000)","journal-title":"J. of Funct. Program."},{"key":"39_CR19","doi-asserted-by":"crossref","unstructured":"Hughes, J., Pareto, L., Sabry, A.: Proving the correctness of reactive systems using sized types. In: Symposium on Principles of Programming Languages, pp. 410\u2013423 (1996)","DOI":"10.1145\/237721.240882"},{"issue":"1","key":"39_CR20","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s00153-002-0156-9","volume":"42","author":"F. Joachimski","year":"2003","unstructured":"Joachimski, F., Matthes, R.: Short proofs of normalization. Archive of Mathematical Logic\u00a042(1), 59\u201387 (2003)","journal-title":"Archive of Mathematical Logic"},{"key":"39_CR21","first-page":"30","volume-title":"Logic in Computer Science (LICS 1987)","author":"N.P. Mendler","year":"1987","unstructured":"Mendler, N.P.: Recursive types and type constraints in second-order lambda calculus. In: Logic in Computer Science (LICS 1987), Ithaca, N.Y, pp. 30\u201336. IEEE Computer Society Press, Los Alamitos (1987)"},{"key":"39_CR22","doi-asserted-by":"crossref","unstructured":"Okasaki, C.: From Fast Exponentiation to Square Matrices: An Adventure in Types. In: International Conference on Functional Programming, pp. 28\u201335 (1999)","DOI":"10.1145\/317636.317781"},{"key":"39_CR23","volume-title":"Types and Programming Languages","author":"B.C. Pierce","year":"2002","unstructured":"Pierce, B.C.: Types and Programming Languages. MIT Press, Cambridge (2002)"},{"issue":"1,2","key":"39_CR24","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/S0304-3975(96)00096-5","volume":"176","author":"B.C. Pierce","year":"1997","unstructured":"Pierce, B.C., Steffen, M.: Higher order subtyping. Theor. Comput. Sci.\u00a0176(1,2), 235\u2013282 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"39_CR25","unstructured":"Steffen, M.: Polarized Higher-Order Subtyping. Ph.D. thesis, Technische Fakult\u00e4t, Universit\u00e4t Erlangen (1998)"},{"key":"39_CR26","doi-asserted-by":"crossref","unstructured":"Watkins, K., Cervesato, I., Pfenning, F., Walker, D.: A concurrent logical framework I: Judgements and properties. Tech. rep., School of Computer Science, Carnegie Mellon University, Pittsburgh (2003)","DOI":"10.21236\/ADA418517"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11753728_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:03:41Z","timestamp":1619492621000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11753728_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540341666","9783540341680"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/11753728_39","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11753728","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}